Image encoding and decoding method and device using prediction network

ABSTRACT

Disclosed herein are a method and apparatus for video decoding and a method and apparatus for video encoding. A prediction block for a target block is generated by predicting the target block using a prediction network, and a reconstructed block for the target block is generated based on the prediction block and a reconstructed residual block. The prediction network includes an intra-prediction network and an inter-prediction network and uses a spatial reference block and/or a temporal reference block when it performs prediction. For learning in the prediction network, a loss function is defined, and learning in the prediction network is performed based on the loss function.

TECHNICAL FIELD

The following embodiments relate generally to a method and apparatus forvideo decoding and a method and apparatus for video encoding, and moreparticularly, to a method and apparatus for image decoding and encodingusing a prediction network.

BACKGROUND ART

With the continuous development of the information and communicationindustries, broadcasting services supporting High-Definition (HD)resolution have been popularized all over the world. Through thispopularization, a large number of users have become accustomed tohigh-resolution and high-definition images and/or videos.

To satisfy users' demand for high definition, many institutions haveaccelerated the development of next-generation imaging devices. Users'interest in UHD TVs, having resolution that is more than four times ashigh as that of Full HD (FHD) TVs, as well as High-Definition TVs (HDTV)and FHD TVs, has increased. As interest therein has increased, imageencoding/decoding technology for images having higher resolution andhigher definition is continually required.

An image encoding/decoding apparatus and method may use inter-predictiontechnology, intra-prediction technology, entropy-coding technology, etc.so as to perform encoding/decoding on a high-resolution andhigh-definition image. Inter-prediction technology may be technology forpredicting the value of a pixel included in a target picture usingtemporally previous pictures and/or temporally subsequent pictures.Intra-prediction technology may be technology for predicting the valueof a pixel included in a target picture using information about pixelsin the target picture. Entropy-coding technology may be technology forassigning short code words to frequently occurring symbols and assigninglong code words to rarely occurring symbols.

Various inter-prediction technologies and intra-prediction technologieshave been developed for more accurate prediction.

DISCLOSURE Technical Problem

An embodiment may provide an encoding apparatus and method and adecoding apparatus and method that predict a target block using aprediction network.

An embodiment may provide an encoding apparatus and method and adecoding apparatus and method that perform learning in a predictionnetwork using specified information that is generated during the processof encoding and/or decoding an image.

Technical Solution

In one aspect, there is provided a decoding method, which includesperforming prediction for a target block using a prediction network,thereby generating a prediction block for the target block; andgenerating a reconstructed block for the target block based on theprediction block.

The prediction network may be an intra-prediction network that performsprediction for the target block using a spatial reference block.

The prediction network may be an inter-prediction network that performsprediction for the target block using a temporal reference block.

The inter-prediction network may perform prediction for the target blockusing a spatial reference block.

The prediction network may comprise multiple prediction networks.

The multiple prediction networks may be used respectively for multiplecolor channels, multiple block sizes, or multiple quantizationparameters.

The prediction network may generate the prediction block by performingprediction for the target block using a reference block.

Preprocessing may be performed for the sample of the reference blockbefore the sample of the reference block is input to the predictionnetwork.

Postprocessing, which is the reverse process of the preprocessing, maybe performed for the sample of the prediction block when the sample ofthe prediction block is output from the prediction network.

The preprocessing may be mean subtraction, normalization, principalcomponent analysis (PCA), or whitening.

Learning in the prediction network may be performed for a single image.

Learning in the prediction network may be performed for a batch.

A batch normalization layer may be inserted in the input end of thehidden layer of the prediction network.

A loss function for learning in the prediction network may be definedbased on a prediction image and an original image.

The loss function may be defined based on the square of the differencebetween the prediction image and the original image.

The loss function may be defined based on the absolute value of thedifference between the prediction image and the original image.

A loss function for online update of the prediction network may bedetermined based on a residual block.

A loss function for online update of the prediction network may bedetermined based on a reconstructed block.

Online update of the network parameter of the prediction network may becontinuously performed during decoding of video.

The network parameter of the prediction network may be initialized for aspecified target.

The specified target may be a slice, a picture, or a picture having anidentifier that is different from the temporal identifier of a previouspicture.

In another aspect, there is provided an encoding method, which includesperforming prediction for a target block using a prediction network,thereby generating a prediction block for the target block; andgenerating a reconstructed block for the target block based on theprediction block.

In a further aspect, there is provided a computer-readable recordingmedium in which a bitstream for decoding of an image is stored, thebitstream including information about a target block. A prediction blockfor the target block may be generated by performing prediction for thetarget block using a prediction network, and a reconstructed block forthe target block may be generated based on the information about thetarget block and the prediction block.

Advantageous Effects

There are provided an encoding apparatus and method and a decodingapparatus and method that predicts a target block using a predictionnetwork.

There are provided an encoding apparatus and method and a decodingapparatus and method that perform learning in a prediction network usingspecified information that is generated during the process of encodingand/or decoding an image.

DESCRIPTION OF DRAWINGS

FIG. 1 is a block diagram illustrating the configuration of anembodiment of an encoding apparatus to which the present disclosure isapplied;

FIG. 2 is a block diagram illustrating the configuration of anembodiment of a decoding apparatus to which the present disclosure isapplied;

FIG. 3 is a diagram schematically illustrating the partition structureof an image when the image is encoded and decoded;

FIG. 4 is a diagram illustrating the form of a Prediction Unit (PU) thata Coding Unit (CU) can include;

FIG. 5 is a diagram illustrating the form of a Transform Unit (TU) thatcan be included in a CU;

FIG. 6 illustrates splitting of a block according to an example;

FIG. 7 is a diagram for explaining an embodiment of an intra-predictionprocedure;

FIG. 8 is a diagram for explaining the locations of reference samplesused in an intra-prediction procedure;

FIG. 9 is a diagram for explaining an embodiment of an inter-predictionprocedure;

FIG. 10 illustrates spatial candidates according to an embodiment;

FIG. 11 illustrates the order of addition of motion information ofspatial candidates to a merge list according to an embodiment;

FIG. 12 illustrates a transform and quantization process according to anexample;

FIG. 13 illustrates diagonal scanning according to an example;

FIG. 14 illustrates horizontal scanning according to an example;

FIG. 15 illustrates vertical scanning according to an example;

FIG. 16 is a configuration diagram of an encoding apparatus according toan embodiment;

FIG. 17 is a configuration diagram of a decoding apparatus according toan embodiment;

FIG. 18 is a flowchart of a method for generating a reconstructed blockaccording to an embodiment;

FIG. 19 is a flowchart of an image-encoding method according to anembodiment;

FIG. 20 is a flowchart of an image-decoding method according to anembodiment;

FIG. 21 shows the generation of a prediction block using anintra-prediction network according to an example;

FIG. 22 shows reference blocks for an intra-prediction network accordingto an example;

FIG. 23 shows reference blocks for an intra-prediction network accordingto an example;

FIG. 24 shows the generation of a prediction block using aninter-prediction network according to an example;

FIG. 25 shows temporal reference blocks for an inter-prediction networkaccording to an example;

FIG. 26 shows an intra-prediction network based on a fully connectedlayer according to an example;

FIG. 27 shows an intra-prediction network based on a convolutional layeraccording to an example; and

FIG. 28 shows the online update of the parameter of a prediction networkaccording to an example.

BEST MODE

The present invention may be variously changed, and may have variousembodiments, and specific embodiments will be described in detail belowwith reference to the attached drawings. However, it should beunderstood that those embodiments are not intended to limit the presentinvention to specific disclosure forms, and that they include allchanges, equivalents or modifications included in the spirit and scopeof the present invention.

Detailed descriptions of the following exemplary embodiments will bemade with reference to the attached drawings illustrating specificembodiments. These embodiments are described so that those havingordinary knowledge in the technical field to which the presentdisclosure pertains can easily practice the embodiments. It should benoted that the various embodiments are different from each other, but donot need to be mutually exclusive of each other. For example, specificshapes, structures, and characteristics described here may beimplemented as other embodiments without departing from the spirit andscope of the embodiments in relation to an embodiment. Further, itshould be understood that the locations or arrangement of individualcomponents in each disclosed embodiment can be changed without departingfrom the spirit and scope of the embodiments. Therefore, theaccompanying detailed description is not intended to restrict the scopeof the disclosure, and the scope of the exemplary embodiments is limitedonly by the accompanying claims, along with equivalents thereof, as longas they are appropriately described.

In the drawings, similar reference numerals are used to designate thesame or similar functions in various aspects. The shapes, sizes, etc. ofcomponents in the drawings may be exaggerated to make the descriptionclear.

Terms such as “first” and “second” may be used to describe variouscomponents, but the components are not restricted by the terms. Theterms are used only to distinguish one component from another component.For example, a first component may be named a second component withoutdeparting from the scope of the present specification. Likewise, asecond component may be named a first component. The terms “and/or” mayinclude combinations of a plurality of related described items or any ofa plurality of related described items.

It will be understood that when a component is referred to as being“connected” or “coupled” to another component, the two components may bedirectly connected or coupled to each other, or intervening componentsmay be present between the two components. It will be understood thatwhen a component is referred to as being “directly connected orcoupled”, no intervening components are present between the twocomponents.

Also, components described in the embodiments are independently shown inorder to indicate different characteristic functions, but this does notmean that each of the components is formed of a separate piece ofhardware or software. That is, the components are arranged and includedseparately for convenience of description. For example, at least two ofthe components may be integrated into a single component. Conversely,one component may be divided into multiple components. An embodimentinto which the components are integrated or an embodiment in which somecomponents are separated is included in the scope of the presentspecification as long as it does not depart from the essence of thepresent specification.

Further, it should be noted that, in the exemplary embodiments, anexpression describing that a component “comprises” a specific componentmeans that additional components may be included within the scope of thepractice or the technical spirit of exemplary embodiments, but does notpreclude the presence of components other than the specific component.

The terms used in the present specification are merely used to describespecific embodiments and are not intended to limit the presentinvention. A singular expression includes a plural expression unless adescription to the contrary is specifically pointed out in context. Inthe present specification, it should be understood that the terms suchas “include” or “have” are merely intended to indicate that features,numbers, steps, operations, components, parts, or combinations thereofare present, and are not intended to exclude the possibility that one ormore other features, numbers, steps, operations, components, parts, orcombinations thereof will be present or added.

Embodiments will be described in detail below with reference to theaccompanying drawings so that those having ordinary knowledge in thetechnical field to which the embodiments pertain can easily practice theembodiments. In the following description of the embodiments, detaileddescriptions of known functions or configurations which are deemed tomake the gist of the present specification obscure will be omitted.Further, the same reference numerals are used to designate the samecomponents throughout the drawings, and repeated descriptions of thesame components will be omitted.

Hereinafter, “image” may mean a single picture constituting a video, ormay mean the video itself. For example, “encoding and/or decoding of animage” may mean “encoding and/or decoding of a video”, and may also mean“encoding and/or decoding of any one of images constituting the video”.

Hereinafter, the terms “video” and “motion picture” may be used to havethe same meaning, and may be used interchangeably with each other.

Hereinafter, a target image may be an encoding target image, which isthe target to be encoded, and/or a decoding target image, which is thetarget to be decoded. Further, the target image may be an input imagethat is input to an encoding apparatus or an input image that is inputto a decoding apparatus.

Hereinafter, the terms “image”, “picture”, “frame”, and “screen” may beused to have the same meaning and may be used interchangeably with eachother.

Hereinafter, a target block may be an encoding target block, i.e. thetarget to be encoded and/or a decoding target block, i.e. the target tobe decoded. Further, the target block may be a current block, i.e. thetarget to be currently encoded and/or decoded. Here, the terms “targetblock” and “current block” may be used to have the same meaning, and maybe used interchangeably with each other.

Hereinafter, the terms “block” and “unit” may be used to have the samemeaning, and may be used interchangeably with each other. Alternatively,“block” may denote a specific unit.

Hereinafter, the terms “region” and “segment” may be usedinterchangeably with each other.

Hereinafter, a specific signal may be a signal indicating a specificblock. For example, the original signal may be a signal indicating atarget block. A prediction signal may be a signal indicating aprediction block. A residual signal may be a signal indicating aresidual block.

In the following embodiments, specific information, data, a flag, anelement, and an attribute may have their respective values. A value of“0” corresponding to each of the information, data, flag, element, andattribute may indicate a logical false or a first predefined value. Inother words, the value of “0”, false, logical false, and a firstpredefined value may be used interchangeably with each other. A value of“1” corresponding to each of the information, data, flag, element, andattribute may indicate a logical true or a second predefined value. Inother words, the value of “1”, true, logical true, and a secondpredefined value may be used interchangeably with each other.

When a variable such as i or j is used to indicate a row, a column, oran index, the value of i may be an integer of 0 or more or an integer of1 or more. In other words, in the embodiments, each of a row, a column,and an index may be counted from 0 or may be counted from 1.

Below, the terms to be used in embodiments will be described.

Encoder: An encoder denotes a device for performing encoding.

Decoder: A decoder denotes a device for performing decoding.

Unit: A unit may denote the unit of image encoding and decoding. Theterms “unit” and “block” may be used to have the same meaning, and maybe used interchangeably with each other.

-   -   “Unit” may be an M×N array of samples. M and N may be positive        integers, respectively. The term “unit” may generally mean a        two-dimensional (2D) array of samples.    -   In the encoding and decoding of an image, “unit” may be an area        generated by the partitioning of one image. In other words,        “unit” may be a region specified in one image. A single image        may be partitioned into multiple units. Alternatively, one image        may be partitioned into sub-parts, and the unit may denote each        partitioned sub-part when encoding or decoding is performed on        the partitioned sub-part.    -   In the encoding and decoding of an image, predefined processing        may be performed on each unit depending on the type of the unit.    -   Depending on functions, the unit types may be classified into a        macro unit, a Coding Unit (CU), a Prediction Unit (PU), a        residual unit, a Transform Unit (TU), etc. Alternatively,        depending on functions, the unit may denote a block, a        macroblock, a coding tree unit, a coding tree block, a coding        unit, a coding block, a prediction unit, a prediction block, a        residual unit, a residual block, a transform unit, a transform        block, etc.    -   The term “unit” may mean information including a luminance        (luma) component block, a chrominance (chroma) component block        corresponding thereto, and syntax elements for respective blocks        so that the unit is designated to be distinguished from a block.    -   The size and shape of a unit may be variously implemented.        Further, a unit may have any of various sizes and shapes. In        particular, the shapes of the unit may include not only a        square, but also a geometric figure that can be represented in        two dimensions (2D), such as a rectangle, a trapezoid, a        triangle, and a pentagon.    -   Further, unit information may include one or more of the type of        a unit, the size of a unit, the depth of a unit, the order of        encoding of a unit and the order of decoding of a unit, etc. For        example, the type of a unit may indicate one of a CU, a PU, a        residual unit and a TU.    -   One unit may be partitioned into sub-units, each having a        smaller size than that of the relevant unit.    -   Depth. A depth may denote the degree to which the unit is        partitioned. Further, the unit depth may indicate the level at        which the corresponding unit is present when units are        represented in a tree structure.    -   Unit partition information may include a depth indicating the        depth of a unit. A depth may indicate the number of times the        unit is partitioned and/or the degree to which the unit is        partitioned.    -   In a tree structure, it may be considered that the depth of a        root node is the smallest, and the depth of a leaf node is the        largest.    -   A single unit may be hierarchically partitioned into multiple        sub-units while having depth information based on a tree        structure. In other words, the unit and sub-units, generated by        partitioning the unit, may correspond to a node and child nodes        of the node, respectively. Each of the partitioned sub-units may        have a unit depth. Since the depth indicates the number of times        the unit is partitioned and/or the degree to which the unit is        partitioned, the partition information of the sub-units may        include information about the sizes of the sub-units.    -   In a tree structure, the top node may correspond to the initial        node before partitioning. The top node may be referred to as a        “root node”. Further, the root node may have a minimum depth        value. Here, the top node may have a depth of level ‘0’.    -   A node having a depth of level ‘1’ may denote a unit generated        when the initial unit is partitioned once. A node having a depth        of level ‘2’ may denote a unit generated when the initial unit        is partitioned twice.    -   A leaf node having a depth of level ‘n’ may denote a unit        generated when the initial unit has been partitioned n times.    -   The leaf node may be a bottom node, which cannot be partitioned        any further. The depth of the leaf node may be the maximum        level. For example, a predefined value for the maximum level may        be 3.    -   A QT depth may denote a depth for a quad-partitioning. A BT        depth may denote a depth for a binary-partitioning. A TT depth        may denote a depth for a ternary-partitioning.

Sample: A sample may be a base unit constituting a block. A sample maybe represented by values from 0 to 2^(Bd-)1 depending on the bit depth(Bd).

-   -   A sample may be a pixel or a pixel value.    -   Hereinafter, the terms “pixel” and “sample” may be used to have        the same meaning, and may be used interchangeably with each        other.

A Coding Tree Unit (CTU): A CTU may be composed of a single lumacomponent (Y) coding tree block and two chroma component (Cb, Cr) codingtree blocks related to the luma component coding tree block. Further, aCTU may mean information including the above blocks and a syntax elementfor each of the blocks.

-   -   Each coding tree unit (CTU) may be partitioned using one or more        partitioning methods, such as a quad tree (QT), a binary tree        (BT), and a ternary tree (TT) so as to configure sub-units, such        as a coding unit, a prediction unit, and a transform unit.        Further, each coding tree unit may be partitioned using a        multitype tree (MTT) using one or more partitioning methods.    -   “CTU” may be used as a term designating a pixel block, which is        a processing unit in an image-decoding and encoding process, as        in the case of partitioning of an input image.

Coding Tree Block (CTB): “CTB” may be used as a term designating any oneof a Y coding tree block, a Cb coding tree block, and a Cr coding treeblock.

Neighbor block: A neighbor block (or neighboring block) may mean a blockadjacent to a target block. A neighbor block may mean a reconstructedneighbor block.

Hereinafter, the terms “neighbor block” and “adjacent block” may be usedto have the same meaning and may be used interchangeably with eachother.

Spatial neighbor block; A spatial neighbor block may a block spatiallyadjacent to a target block. A neighbor block may include a spatialneighbor block.

-   -   The target block and the spatial neighbor block may be included        in a target picture.    -   The spatial neighbor block may mean a block, the boundary of        which is in contact with the target block, or a block located        within a predetermined distance from the target block.    -   The spatial neighbor block may mean a block adjacent to the        vertex of the target block. Here, the block adjacent to the        vertex of the target block may mean a block vertically adjacent        to a neighbor block which is horizontally adjacent to the target        block or a block horizontally adjacent to a neighbor block which        is vertically adjacent to the target block.

Temporal neighbor block: A temporal neighbor block may be a blocktemporally adjacent to a target block. A neighbor block may include atemporal neighbor block.

-   -   The temporal neighbor block may include a co-located block (col        block).    -   The col block may be a block in a previously reconstructed        co-located picture (col picture). The location of the col block        in the col-picture may correspond to the location of the target        block in a target picture. Alternatively, the location of the        col block in the col-picture may be equal to the location of the        target block in the target picture. The col picture may be a        picture included in a reference picture list.    -   The temporal neighbor block may be a block temporally adjacent        to a spatial neighbor block of a target block.

Prediction unit: A prediction unit may be a base unit for prediction,such as inter prediction, intra prediction, inter compensation, intracompensation, and motion compensation.

-   -   A single prediction unit may be divided into multiple partitions        having smaller sizes or sub-prediction units. The multiple        partitions may also be base units in the performance of        prediction or compensation. The partitions generated by dividing        the prediction unit may also be prediction units.

Prediction unit partition: A prediction unit partition may be the shapeinto which a prediction unit is divided.

Reconstructed neighboring unit: A reconstructed neighboring unit may bea unit which has already been decoded and reconstructed around a targetunit.

-   -   A reconstructed neighboring unit may be a unit that is spatially        adjacent to the target unit or that is temporally adjacent to        the target unit.    -   A reconstructed spatially neighboring unit may be a unit which        is included in a target picture and which has already been        reconstructed through encoding and/or decoding.    -   A reconstructed temporally neighboring unit may be a unit which        is included in a reference image and which has already been        reconstructed through encoding and/or decoding. The location of        the reconstructed temporally neighboring unit in the reference        image may be identical to that of the target unit in the target        picture, or may correspond to the location of the target unit in        the target picture.

Parameter set: A parameter set may be header information in thestructure of a bitstream. For example, a parameter set may include avideo parameter set (VPS), a sequence parameter set (SPS), a pictureparameter set (PPS), an adaptation parameter set APS), etc.

Further, the parameter set may include slice header information and tileheader information.

Rate-distortion optimization: An encoding apparatus may userate-distortion optimization so as to provide high coding efficiency byutilizing combinations of the size of a coding unit (CU), a predictionmode, the size of a prediction unit (PU), motion information, and thesize of a transform unit (TU).

-   -   A rate-distortion optimization scheme may calculate        rate-distortion costs of respective combinations so as to select        an optimal combination from among the combinations. The        rate-distortion costs may be calculated using the following        Equation 1. Generally, a combination enabling the        rate-distortion cost to be minimized may be selected as the        optimal combination in the rate-distortion optimization scheme.

D+λ*R  [Equation 1]

-   -   D may denote distortion. D may be the mean of squares of        differences (i.e. mean square error) between original transform        coefficients and reconstructed transform coefficients in a        transform unit.    -   R may denote the rate, which may denote a bit rate using        related-context information.    -   λ denotes a Lagrangian multiplier. R may include not only coding        parameter information, such as a prediction mode, motion        information, and a coded block flag, but also bits generated due        to the encoding of transform coefficients.    -   An encoding apparatus may perform procedures, such as inter        prediction and/or intra prediction, transform, quantization,        entropy encoding, inverse quantization (dequantization), and        inverse transform so as to calculate precise D and R. These        procedures may greatly increase the complexity of the encoding        apparatus.    -   Bitstream: A bitstream may denote a stream of bits including        encoded image information.    -   Parameter set: A parameter set may be header information in the        structure of a bitstream.    -   The parameter set may include at least one of a video parameter        set, a sequence parameter set, a picture parameter set, and an        adaptation parameter set. Further, the parameter set may include        information about a slice header and information about a tile        header.

Parsing: Parsing may be the decision on the value of a syntax element,made by performing entropy decoding on a bitstream. Alternatively, theterm “parsing” may mean such entropy decoding itself.

Symbol: A symbol may be at least one of the syntax element, the codingparameter, and the transform coefficient of an encoding target unitand/or a decoding target unit. Further, a symbol may be the target ofentropy encoding or the result of entropy decoding.

Reference picture: A reference picture may be an image referred to by aunit so as to perform inter prediction or motion compensation.Alternatively, a reference picture may be an image including a referenceunit referred to by a target unit so as to perform inter prediction ormotion compensation.

Hereinafter, the terms “reference picture” and “reference image” may beused to have the same meaning, and may be used interchangeably with eachother.

Reference picture list: A reference picture list may be a list includingone or more reference images used for inter prediction or motioncompensation.

-   -   The types of a reference picture list may include List Combined        (LC), List 0 (L0), List 1 (L1), List 2 (L2), List 3 (L3), etc.    -   For inter prediction, one or more reference picture lists may be        used.

Inter-prediction indicator: An inter-prediction indicator may indicatethe inter-prediction direction for a target unit. Inter prediction maybe one of unidirectional prediction and bidirectional prediction.Alternatively, the inter-prediction indicator may denote the number ofreference images used to generate a prediction unit of a target unit.Alternatively, the inter-prediction indicator may denote the number ofprediction blocks used for inter prediction or motion compensation of atarget unit.

Reference picture index: A reference picture index may be an indexindicating a specific reference image in a reference picture list.

Motion vector (MV): A motion vector may be a 2D vector used for interprediction or motion compensation. A motion vector may mean an offsetbetween a target image and a reference image.

-   -   For example, a MV may be represented in a form such as (mv_(x),        mv_(y)). mv_(x) may indicate a horizontal component, and mv_(y)        may indicate a vertical component.    -   Search range: A search range may be a 2D area in which a search        for a MV is performed during inter prediction. For example, the        size of the search range may be M×N. M and N may be respective        positive integers.

Motion vector candidate: A motion vector candidate may be a block thatis a prediction candidate or the motion vector of the block that is aprediction candidate when a motion vector is predicted.

-   -   A motion vector candidate may be included in a motion vector        candidate list.

Motion vector candidate list: A motion vector candidate list may be alist configured using one or more motion vector candidates.

Motion vector candidate index: A motion vector candidate index may be anindicator for indicating a motion vector candidate in the motion vectorcandidate list. Alternatively, a motion vector candidate index may bethe index of a motion vector predictor.

Motion information: Motion information may be information including atleast one of a reference picture list, a reference image, a motionvector candidate, a motion vector candidate index, a merge candidate,and a merge index, as well as a motion vector, a reference pictureindex, and an inter-prediction indicator.

Merge candidate list: A merge candidate list may be a list configuredusing merge candidates.

Merge candidate: A merge candidate may be a spatial merge candidate, atemporal merge candidate, a combined merge candidate, a combinedbi-prediction merge candidate, a zero-merge candidate, etc. A mergecandidate may include motion information such as prediction typeinformation, a reference picture index for each list, and a motionvector.

Merge index: A merge index may be an indicator for indicating a mergecandidate in a merge candidate list.

-   -   A merge index may indicate a reconstructed unit used to derive a        merge candidate between a reconstructed unit spatially adjacent        to a target unit and a reconstructed unit temporally adjacent to        the target unit.    -   A merge index may indicate at least one of pieces of motion        information of a merge candidate.

Transform unit: A transform unit may be the base unit of residual signalencoding and/or residual signal decoding, such as transform, inversetransform, quantization, dequantization, transform coefficient encoding,and transform coefficient decoding. A single transform unit may bepartitioned into multiple transform units having smaller sizes.

Scaling: Scaling may denote a procedure for multiplying a factor by atransform coefficient level.

-   -   As a result of scaling of the transform coefficient level, a        transform coefficient may be generated. Scaling may also be        referred to as “dequantization”.

Quantization Parameter (QP): A quantization parameter may be a valueused to generate a transform coefficient level for a transformcoefficient in quantization. Alternatively, a quantization parameter mayalso be a value used to generate a transform coefficient by scaling thetransform coefficient level in dequantization. Alternatively, aquantization parameter may be a value mapped to a quantization stepsize.

Delta quantization parameter: A delta quantization parameter is adifferential value between a predicted quantization parameter and thequantization parameter of a target unit.

Scan: Scan may denote a method for aligning the order of coefficients ina unit, a block or a matrix. For example, a method for aligning a 2Darray in the form of a one-dimensional (1D) array may be referred to asa “scan”. Alternatively, a method for aligning a 1D array in the form ofa 2D array may also be referred to as a “scan” or an “inverse scan”.

Transform coefficient: A transform coefficient may be a coefficientvalue generated as an encoding apparatus performs a transform.Alternatively, the transform coefficient may be a coefficient valuegenerated as a decoding apparatus performs at least one of entropydecoding and dequantization.

-   -   A quantized level or a quantized transform coefficient level        generated by applying quantization to a transform coefficient or        a residual signal may also be included in the meaning of the        term “transform coefficient”.

Quantized level: A quantized level may be a value generated as theencoding apparatus performs quantization on a transform coefficient or aresidual signal. Alternatively, the quantized level may be a value thatis the target of dequantization as the decoding apparatus performsdequantization.

-   -   A quantized transform coefficient level, which is the result of        transform and quantization, may also be included in the meaning        of a quantized level.

Non-zero transform coefficient: A non-zero transform coefficient may bea transform coefficient having a value other than 0 or a transformcoefficient level having a value other than 0. Alternatively, a non-zerotransform coefficient may be a transform coefficient, the magnitude ofthe value of which is not 0, or a transform coefficient level, themagnitude of the value of which is not 0.

Quantization matrix: A quantization matrix may be a matrix used in aquantization procedure or a dequantization procedure so as to improvethe subjective image quality or objective image quality of an image. Aquantization matrix may also be referred to as a “scaling list”.

Quantization matrix coefficient: A quantization matrix coefficient maybe each element in a quantization matrix. A quantization matrixcoefficient may also be referred to as a “matrix coefficient”.

Default matrix: A default matrix may be a quantization matrix predefinedby the encoding apparatus and the decoding apparatus.

Non-default matrix: A non-default matrix may be a quantization matrixthat is not predefined by the encoding apparatus and the decodingapparatus. The non-default matrix may be signaled by the encodingapparatus to the decoding apparatus.

Most Probable Mode (MPM): An MPM may denote an intra-prediction modehaving a high probability of being used for intra prediction for atarget block.

An encoding apparatus and a decoding apparatus may determine one or moreMPMs based on coding parameters related to the target block and theattributes of entities related to the target block.

The encoding apparatus and the decoding apparatus may determine one ormore MPMs based on the intra-prediction mode of a reference block. Thereference block may include multiple reference blocks. The multiplereference blocks may include spatial neighbor blocks adjacent to theleft of the target block and spatial neighbor blocks adjacent to the topof the target block. In other words, depending on which intra-predictionmodes have been used for the reference blocks, one or more differentMPMs may be determined.

The one or more MPMs may be determined in the same manner both in theencoding apparatus and in the decoding apparatus. That is, the encodingapparatus and the decoding apparatus may share the same MPM listincluding one or more MPMs.

MPM list: An MPM list may be a list including one or more MPMs. Thenumber of the one or more MPMs in the MPM list may be defined inadvance.

MPM indicator: An MPM indicator may indicate an MPM to be used for intraprediction for a target block among one or more MPMs in the MPM list.For example, the MPM indicator may be an index for the MPM list.

Since the MPM list is determined in the same manner both in the encodingapparatus and in the decoding apparatus, there may be no need totransmit the MPM list itself from the encoding apparatus to the decodingapparatus.

The MPM indicator may be signaled from the encoding apparatus to thedecoding apparatus. As the MPM indicator is signaled, the decodingapparatus may determine the MPM to be used for intra prediction for thetarget block among the MPMs in the MPM list.

MPM use indicator: An MPM use indicator may indicate whether an MPMusage mode is to be used for prediction for a target block. The MPMusage mode may be a mode in which the MPM to be used for intraprediction for the target block is determined using the MPM list.

The MPM usage indicator may be signaled from the encoding apparatus tothe decoding apparatus.

Signaling: “signaling” may denote that information is transferred froman encoding apparatus to a decoding apparatus. Alternatively,“signaling” may mean information is included in in a bitstream or arecoding medium. Information signaled by an encoding apparatus may beused by a decoding apparatus.

FIG. 1 is a block diagram illustrating the configuration of anembodiment of an encoding apparatus to which the present disclosure isapplied.

An encoding apparatus 100 may be an encoder, a video encoding apparatusor an image encoding apparatus. A video may include one or more images(pictures). The encoding apparatus 100 may sequentially encode one ormore images of the video.

Referring to FIG. 1, the encoding apparatus 100 includes aninter-prediction unit 110, an intra-prediction unit 120, a switch 115, asubtractor 125, a transform unit 130, a quantization unit 140, anentropy encoding unit 150, a dequantization (inverse quantization) unit160, an inverse transform unit 170, an adder 175, a filter unit 180, anda reference picture buffer 190.

The encoding apparatus 100 may perform encoding on a target image usingan intra mode and/or an inter mode.

Further, the encoding apparatus 100 may generate a bitstream, includinginformation about encoding, via encoding on the target image, and mayoutput the generated bitstream. The generated bitstream may be stored ina computer-readable storage medium and may be streamed through awired/wireless transmission medium.

When the intra mode is used as a prediction mode, the switch 115 mayswitch to the intra mode. When the inter mode is used as a predictionmode, the switch 115 may switch to the inter mode.

The encoding apparatus 100 may generate a prediction block of a targetblock. Further, after the prediction block has been generated, theencoding apparatus 100 may encode a residual between the target blockand the prediction block.

When the prediction mode is the intra mode, the intra-prediction unit120 may use pixels of previously encoded/decoded neighboring blocksaround the target block as reference samples. The intra-prediction unit120 may perform spatial prediction on the target block using thereference samples, and may generate prediction samples for the targetblock via spatial prediction.

The inter-prediction unit 110 may include a motion prediction unit and amotion compensation unit.

When the prediction mode is an inter mode, the motion prediction unitmay search a reference image for the area most closely matching thetarget block in a motion prediction procedure, and may derive a motionvector for the target block and the found area based on the found area.

The reference image may be stored in the reference picture buffer 190.More specifically, the reference image may be stored in the referencepicture buffer 190 when the encoding and/or decoding of the referenceimage have been processed.

The motion compensation unit may generate a prediction block for thetarget block by performing motion compensation using a motion vector.Here, the motion vector may be a two-dimensional (2D) vector used forinter-prediction. Further, the motion vector may indicate an offsetbetween the target image and the reference image.

The motion prediction unit and the motion compensation unit may generatea prediction block by applying an interpolation filter to a partial areaof a reference image when the motion vector has a value other than aninteger. In order to perform inter prediction or motion compensation, itmay be determined which one of a skip mode, a merge mode, an advancedmotion vector prediction (AMVP) mode, and a current picture referencemode corresponds to a method for predicting the motion of a PU includedin a CU, based on the CU, and compensating for the motion, and interprediction or motion compensation may be performed depending on themode.

The subtractor 125 may generate a residual block, which is thedifferential between the target block and the prediction block. Aresidual block may also be referred to as a “residual signal”.

The residual signal may be the difference between an original signal anda prediction signal. Alternatively, the residual signal may be a signalgenerated by transforming or quantizing the difference between anoriginal signal and a prediction signal or by transforming andquantizing the difference. A residual block may be a residual signal fora block unit.

The transform unit 130 may generate a transform coefficient bytransforming the residual block, and may output the generated transformcoefficient. Here, the transform coefficient may be a coefficient valuegenerated by transforming the residual block.

The transform unit 130 may use one of multiple predefined transformmethods when performing a transform.

The multiple predefined transform methods may include a Discrete CosineTransform (DCT), a Discrete Sine Transform (DST), a Karhunen-LoeveTransform (KLT), etc.

The transform method used to transform a residual block may bedetermined depending on at least one of coding parameters for a targetblock and/or a neighboring block. For example, the transform method maybe determined based on at least one of an inter-prediction mode for aPU, an intra-prediction mode for a PU, the size of a TU, and the shapeof a TU. Alternatively, transformation information indicating thetransform method may be signaled from the encoding apparatus 100 to thedecoding apparatus 200.

When a transform skip mode is used, the transform unit 130 may omittransforming the residual block.

By applying quantization to the transform coefficient, a quantizedtransform coefficient level or a quantized level may be generated.Hereinafter, in the embodiments, each of the quantized transformcoefficient level and the quantized level may also be referred to as a‘transform coefficient’.

The quantization unit 140 may generate a quantized transform coefficientlevel (i.e., a quantized level or a quantized coefficient) by quantizingthe transform coefficient depending on quantization parameters. Thequantization unit 140 may output the quantized transform coefficientlevel that is generated. In this case, the quantization unit 140 mayquantize the transform coefficient using a quantization matrix.

The entropy encoding unit 150 may generate a bitstream by performingprobability distribution-based entropy encoding based on values,calculated by the quantization unit 140, and/or coding parameter values,calculated in the encoding procedure. The entropy encoding unit 150 mayoutput the generated bitstream.

The entropy encoding unit 150 may perform entropy encoding oninformation about the pixels of the image and information required todecode the image. For example, the information required to decode theimage may include syntax elements or the like.

When entropy encoding is applied, fewer bits may be assigned to morefrequently occurring symbols, and more bits may be assigned to rarelyoccurring symbols. As symbols are represented by means of thisassignment, the size of a bit string for target symbols to be encodedmay be reduced. Therefore, the compression performance of video encodingmay be improved through entropy encoding.

Further, for entropy encoding, the entropy encoding unit 150 may use acoding method such as exponential Golomb, Context-Adaptive VariableLength Coding (CAVLC), or Context-Adaptive Binary Arithmetic Coding(CABAC). For example, the entropy encoding unit 150 may perform entropyencoding using a Variable Length Coding/Code (VLC) table. For example,the entropy encoding unit 150 may derive a binarization method for atarget symbol. Further, the entropy encoding unit 150 may derive aprobability model for a target symbol/bin. The entropy encoding unit 150may perform arithmetic coding using the derived binarization method, aprobability model, and a context model.

The entropy encoding unit 150 may transform the coefficient of the formof a 2D block into the form of a 1D vector through a transformcoefficient scanning method so as to encode a quantized transformcoefficient level.

The coding parameters may be information required for encoding and/ordecoding. The coding parameters may include information encoded by theencoding apparatus 100 and transferred from the encoding apparatus 100to a decoding apparatus, and may also include information that may bederived in the encoding or decoding procedure. For example, informationtransferred to the decoding apparatus may include syntax elements.

The coding parameters may include not only information (or a flag or anindex), such as a syntax element, which is encoded by the encodingapparatus and is signaled by the encoding apparatus to the decodingapparatus, but also information derived in an encoding or decodingprocess. Further, the coding parameters may include information requiredso as to encode or decode images. For example, the coding parameters mayinclude at least one value, combinations or statistics of the size of aunit/block, the depth of a unit/block, partition information of aunit/block, the partition structure of a unit/block, informationindicating whether a unit/block is partitioned in a quad-tree structure,information indicating whether a unit/block is partitioned in a binarytree structure, the partitioning direction of a binary tree structure(horizontal direction or vertical direction), the partitioning form of abinary tree structure (symmetrical partitioning or asymmetricalpartitioning), information indicating whether a unit/block ispartitioned in a ternary tree structure, the partitioning direction of aternary tree structure (horizontal direction or vertical direction), thepartitioning form of a ternary tree structure (symmetrical partitioningor asymmetrical partitioning, etc.), information indicating whether aunit/block is partitioned in a complex tree structure, a combination anda direction (horizontal direction or vertical direction, etc.) of apartitioning of the complex tree structure, a prediction scheme (intraprediction or inter prediction), an intra-prediction mode/direction, areference sample filtering method, a prediction block filtering method,a prediction block boundary filtering method, a filter tap forfiltering, a filter coefficient for filtering, an inter-prediction mode,motion information, a motion vector, a reference picture index, aninter-prediction direction, an inter-prediction indicator, a referencepicture list, a reference image, a motion vector predictor, a motionvector prediction candidate, a motion vector candidate list, informationindicating whether a merge mode is used, a merge candidate, a mergecandidate list, information indicating whether a skip mode is used, thetype of an interpolation filter, the tap of an interpolation filter, thefilter coefficient of an interpolation filter, the magnitude of a motionvector, accuracy of motion vector representation, a transform type, atransform size, information indicating whether a primary transform isused, information indicating whether an additional (secondary) transformis used, first transform selection information (or a first transformindex), secondary transform selection information (or a secondarytransform index), information indicating the presence or absence of aresidual signal, a coded block pattern, a coded block flag, aquantization parameter, a quantization matrix, information about anintra-loop filter, information indicating whether an intra-loop filteris applied, the coefficient of an intra-loop filter, the tap of anintra-loop filter, the shape/form of an intra-loop filter, informationindicating whether a deblocking filter is applied, the coefficient of adeblocking filter, the tap of a deblocking filter, deblocking filterstrength, the shape/form of a deblocking filter, information indicatingwhether an adaptive sample offset is applied, the value of an adaptivesample offset, the category of an adaptive sample offset, the type of anadaptive sample offset, information indicating whether an adaptivein-loop filter is applied, the coefficient of an adaptive in-loopfilter, the tap of an adaptive in-loop filter, the shape/form of anadaptive in-loop filter, a binarization/inverse binarization method, acontext model, a context model decision method, a context model updatemethod, information indicating whether a regular mode is performed,information whether a bypass mode is performed, a context bin, a bypassbin, a transform coefficient, a transform coefficient level, a transformcoefficient level scanning method, an image display/output order, sliceidentification information, a slice type, slice partition information,tile identification information, a tile type, tile partitioninformation, a picture type, bit depth, information about a luma signal,and information about a chroma signal. The prediction scheme may denoteone prediction mode of an intra prediction mode and an inter predictionmode.

The first transform selection information may indicate a first transformwhich is applied to a target block.

The second transform selection information may indicate a secondtransform which is applied to a target block.

The residual signal may denote the difference between the originalsignal and a prediction signal. Alternatively, the residual signal maybe a signal generated by transforming the difference between theoriginal signal and the prediction signal. Alternatively, the residualsignal may be a signal generated by transforming and quantizing thedifference between the original signal and the prediction signal. Aresidual block may be the residual signal for a block.

Here, signaling a flag or an index may mean that the encoding apparatus100 includes an entropy-encoded flag or an entropy-encoded index,generated by performing entropy encoding on the flag or index, in abitstream, and that the decoding apparatus 200 acquires a flag or anindex by performing entropy decoding on the entropy-encoded flag or theentropy-encoded index, extracted from the bitstream.

Since the encoding apparatus 100 performs encoding via inter prediction,the encoded target image may be used as a reference image for additionalimage(s) to be subsequently processed. Therefore, the encoding apparatus100 may reconstruct or decode the encoded target image and store thereconstructed or decoded image as a reference image in the referencepicture buffer 190. For decoding, dequantization and inverse transformon the encoded target image may be processed.

The quantized level may be inversely quantized by the dequantizationunit 160, and may be inversely transformed by the inverse transform unit170. The dequantization unit 160 may generate an inversely quantizedcoefficient by performing inverse transform for the quantized level. Theinverse transform unit 170 may generate a reconstructed residual blockby performing inverse transform for the inversely quantized coefficient.In other words, the reconstructed residual block is a coefficient thathas been inversely quantized and inversely transformed.

The coefficient that has been inversely quantized and inverselytransformed may be added to the prediction block by the adder 175. Theinversely quantized and/or inversely transformed coefficient and theprediction block are added, and then a reconstructed block may begenerated. Here, the inversely quantized and/or inversely transformedcoefficient may denote a coefficient on which one or more ofdequantization and inverse transform are performed, and may also denotea reconstructed residual block.

The reconstructed block may be subjected to filtering through the filterunit 180. The filter unit 180 may apply one or more of a deblockingfilter, a Sample Adaptive Offset (SAO) filter, an Adaptive Loop Filter(ALF) and a Non Local Filter (NLF) to the reconstructed block or areconstructed picture. The filter unit 180 may also be referred to as an“in-loop filter”.

The deblocking filter may eliminate block distortion occurring at theboundaries between blocks. In order to determine whether to apply thedeblocking filter, the number of columns or rows which are included in ablock and which include pixel(s) based on which it is determined whetherto apply the deblocking filter to a target block may be decided on.

When the deblocking filter is applied to the target block, the appliedfilter may differ depending on the strength of the required deblockingfiltering. In other words, among different filters, a filter decided onin consideration of the strength of deblocking filtering may be appliedto the target block. When a deblocking filter is applied to a targetblock, a filter corresponding to any one of a strong filter and a weakfilter may be applied to the target block depending on the strength ofrequired deblocking filtering.

Also, when vertical filtering and horizontal filtering are performed onthe target block, the horizontal filtering and the vertical filteringmay be processed in parallel.

The SAO may add a suitable offset to the values of pixels to compensatefor coding error. The SAO may perform, for the image to which deblockingis applied, correction that uses an offset in the difference between anoriginal image and the image to which deblocking is applied, on a pixelbasis. To perform an offset correction for an image, a method fordividing the pixels included in the image into a certain number ofregions, determining a region to which an offset is to be applied, amongthe divided regions, and applying an offset to the determined region maybe used, and a method for applying an offset in consideration of edgeinformation of each pixel may also be used.

The ALF may perform filtering based on a value obtained by comparing areconstructed image with an original image. After pixels included in animage have been divided into a predetermined number of groups, filtersto be applied to each group may be determined, and filtering may bedifferentially performed for respective groups. For a luma signal,information related to whether to apply an adaptive loop filter may besignaled for each CU. The shapes and filter coefficients of ALFs to beapplied to respective blocks may differ for respective blocks.Alternatively, regardless of the features of a block, an ALF having afixed form may be applied to the block.

A non-local filter may perform filtering based on reconstructed blocks,similar to a target block. A region similar to the target block may beselected from a reconstructed picture, and filtering of the target blockmay be performed using the statistical properties of the selectedsimilar region. Information about whether to apply a non-local filtermay be signaled for a Coding Unit (CU). Also, the shapes and filtercoefficients of the non-local filter to be applied to blocks may differdepending on the blocks.

The reconstructed block or the reconstructed image subjected tofiltering through the filter unit 180 may be stored in the referencepicture buffer 190. The reconstructed block subjected to filteringthrough the filter unit 180 may be a part of a reference picture. Inother words, the reference picture may be a reconstructed picturecomposed of reconstructed blocks subjected to filtering through thefilter unit 180. The stored reference picture may be subsequently usedfor inter prediction.

FIG. 2 is a block diagram illustrating the configuration of anembodiment of a decoding apparatus to which the present disclosure isapplied.

A decoding apparatus 200 may be a decoder, a video decoding apparatus oran image decoding apparatus.

Referring to FIG. 2, the decoding apparatus 200 may include an entropydecoding unit 210, a dequantization (inverse quantization) unit 220, aninverse transform unit 230, an intra-prediction unit 240, aninter-prediction unit 250, a switch 245 an adder 255, a filter unit 260,and a reference picture buffer 270.

The decoding apparatus 200 may receive a bitstream output from theencoding apparatus 100. The decoding apparatus 200 may receive abitstream stored in a computer-readable storage medium, and may receivea bitstream that is streamed through a wired/wireless transmissionmedium.

The decoding apparatus 200 may perform decoding on the bitstream in anintra mode and/or an inter mode. Further, the decoding apparatus 200 maygenerate a reconstructed image or a decoded image via decoding, and mayoutput the reconstructed image or decoded image.

For example, switching to an intra mode or an inter mode based on theprediction mode used for decoding may be performed by the switch 245.When the prediction mode used for decoding is an intra mode, the switch245 may be operated to switch to the intra mode. When the predictionmode used for decoding is an inter mode, the switch 245 may be operatedto switch to the inter mode.

The decoding apparatus 200 may acquire a reconstructed residual block bydecoding the input bitstream, and may generate a prediction block. Whenthe reconstructed residual block and the prediction block are acquired,the decoding apparatus 200 may generate a reconstructed block, which isthe target to be decoded, by adding the reconstructed residual block tothe prediction block.

The entropy decoding unit 210 may generate symbols by performing entropydecoding on the bitstream based on the probability distribution of abitstream. The generated symbols may include symbols in a form of aquantized transform coefficient level (i.e., a quantized level or aquantized coefficient). Here, the entropy decoding method may be similarto the above-described entropy encoding method. That is, the entropydecoding method may be the reverse procedure of the above-describedentropy encoding method.

The entropy decoding unit 210 may change a coefficient having aone-dimensional (1D) vector form to a 2D block shape through a transformcoefficient scanning method in order to decode a quantized transformcoefficient level.

For example, the coefficients of the block may be changed to 2D blockshapes by scanning the block coefficients using up-right diagonalscanning. Alternatively, which one of up-right diagonal scanning,vertical scanning, and horizontal scanning is to be used may bedetermined depending on the size and/or the intra-prediction mode of thecorresponding block.

The quantized coefficient may be inversely quantized by thedequantization unit 220. The dequantization unit 220 may generate aninversely quantized coefficient by performing dequantization on thequantized coefficient. Further, the inversely quantized coefficient maybe inversely transformed by the inverse transform unit 230. The inversetransform unit 230 may generate a reconstructed residual block byperforming an inverse transform on the inversely quantized coefficient.As a result of performing dequantization and the inverse transform onthe quantized coefficient, the reconstructed residual block may begenerated. Here, the dequantization unit 220 may apply a quantizationmatrix to the quantized coefficient when generating the reconstructedresidual block.

When the intra mode is used, the intra-prediction unit 240 may generatea prediction block by performing spatial prediction that uses the pixelvalues of previously decoded neighboring blocks around a target block.

The inter-prediction unit 250 may include a motion compensation unit.Alternatively, the inter-prediction unit 250 may be designated as a“motion compensation unit”.

When the inter mode is used, the motion compensation unit may generate aprediction block by performing motion compensation that uses a motionvector and a reference image stored in the reference picture buffer 270.

The motion compensation unit may apply an interpolation filter to apartial area of the reference image when the motion vector has a valueother than an integer, and may generate a prediction block using thereference image to which the interpolation filter is applied. In orderto perform motion compensation, the motion compensation unit maydetermine which one of a skip mode, a merge mode, an Advanced MotionVector Prediction (AMVP) mode, and a current picture reference modecorresponds to the motion compensation method used for a PU included ina CU, based on the CU, and may perform motion compensation depending onthe determined mode.

The reconstructed residual block and the prediction block may be addedto each other by the adder 255. The adder 255 may generate areconstructed block by adding the reconstructed residual block to theprediction block.

The reconstructed block may be subjected to filtering through the filterunit 260. The filter unit 260 may apply at least one of a deblockingfilter, an SAO filter, an ALF, and a NLF to the reconstructed block orthe reconstructed image. The reconstructed image may be a pictureincluding the reconstructed block.

The reconstructed image subjected to filtering may be outputted by theencoding apparatus 100, and may be used by the encoding apparatus.

The reconstructed image subjected to filtering through the filter unit260 may be stored as a reference picture in the reference picture buffer270. The reconstructed block subjected to filtering through the filterunit 260 may be apart of the reference picture. In other words, thereference picture may be an image composed of reconstructed blockssubjected to filtering through the filter unit 260. The stored referencepicture may be subsequently used for inter prediction.

FIG. 3 is a diagram schematically illustrating the partition structureof an image when the image is encoded and decoded.

FIG. 3 may schematically illustrate an example in which a single unit ispartitioned into multiple sub-units.

In order to efficiently partition the image, a Coding Unit (CU) may beused in encoding and decoding. The term “unit” may be used tocollectively designate 1) a block including image samples and 2) asyntax element. For example, the “partitioning of a unit” may mean the“partitioning of a block corresponding to a unit”.

A CU may be used as a base unit for image encoding/decoding. A CU may beused as a unit to which one mode selected from an intra mode and aninter mode in image encoding/decoding is applied. In other words, inimage encoding/decoding, which one of an intra mode and an inter mode isto be applied to each CU may be determined.

Further, a CU may be a base unit in prediction, transform, quantization,inverse transform, dequantization, and encoding/decoding of transformcoefficients.

Referring to FIG. 3, an image 200 may be sequentially partitioned intounits corresponding to a Largest Coding Unit (LCU), and a partitionstructure may be determined for each LCU. Here, the LCU may be used tohave the same meaning as a Coding Tree Unit (CTU).

The partitioning of a unit may mean the partitioning of a blockcorresponding to the unit. Block partition information may include depthinformation about the depth of a unit. The depth information mayindicate the number of times the unit is partitioned and/or the degreeto which the unit is partitioned. A single unit may be hierarchicallypartitioned into sub-units while having depth information based on atree structure. Each of partitioned sub-units may have depthinformation. The depth information may be information indicating thesize of a CU. The depth information may be stored for each CU.

Each CU may have depth information. When the CU is partitioned, CUsresulting from partitioning may have a depth increased from the depth ofthe partitioned CU by 1.

The partition structure may mean the distribution of Coding Units (CUs)to efficiently encode the image in an LCU 310. Such a distribution maybe determined depending on whether a single CU is to be partitioned intomultiple CUs. The number of CUs generated by partitioning may be apositive integer of 2 or more, including 2, 3, 4, 8, 16, etc. Thehorizontal size and the vertical size of each of CUs generated by thepartitioning may be less than the horizontal size and the vertical sizeof a CU before being partitioned, depending on the number of CUsgenerated by partitioning.

Each partitioned CU may be recursively partitioned into four CUs in thesame way. Via the recursive partitioning, at least one of the horizontalsize and the vertical size of each partitioned CU may be reducedcompared to at least one of the horizontal size and the vertical size ofthe CU before being partitioned.

The partitioning of a CU may be recursively performed up to a predefineddepth or a predefined size. For example, the depth of a CU may have avalue ranging from 0 to 3. The size of the CU may range from a size of64×64 to a size of 8×8 depending on the depth of the CU.

For example, the depth of an LCU may be 0, and the depth of a SmallestCoding Unit (SCU) may be a predefined maximum depth. Here, as describedabove, the LCU may be the CU having the maximum coding unit size, andthe SCU may be the CU having the minimum coding unit size.

Partitioning may start at the LCU 310, and the depth of a CU may beincreased by 1 whenever the horizontal and/or vertical sizes of the CUare reduced by partitioning.

For example, for respective depths, a CU that is not partitioned mayhave a size of 2N×2N. Further, in the case of a CU that is partitioned,a CU having a size of 2N×2N may be partitioned into four CUs, eachhaving a size of N×N. The value of N may be halved whenever the depth isincreased by 1.

Referring to FIG. 3, an LCU having a depth of 0 may have 64×64 pixels or64×64 blocks. 0 may be a minimum depth. An SCU having a depth of 3 mayhave 8×8 pixels or 8×8 blocks. 3 may be a maximum depth. Here, a CUhaving 64×64 blocks, which is the LCU, may be represented by a depth of0. A CU having 32×32 blocks may be represented by a depth of 1. A CUhaving 16×16 blocks may be represented by a depth of 2. A CU having 8×8blocks, which is the SCU, may be represented by a depth of 3.

Information about whether the corresponding CU is partitioned may berepresented by the partition information of the CU. The partitioninformation may be 1-bit information. All CUs except the SCU may includepartition information. For example, the value of the partitioninformation of a CU that is not partitioned may be 0. The value of thepartition information of a CU that is partitioned may be 1.

For example, when a single CU is partitioned into four CUs, thehorizontal size and vertical size of each of four CUs generated bypartitioning may be half the horizontal size and the vertical size ofthe CU before being partitioned. When a CU having a 32×32 size ispartitioned into four CUs, the size of each of four partitioned CUs maybe 16×16. When a single CU is partitioned into four CUs, it may beconsidered that the CU has been partitioned in a quad-tree structure.

For example, when a single CU is partitioned into two CUs, thehorizontal size or the vertical size of each of two CUs generated bypartitioning may be half the horizontal size or the vertical size of theCU before being partitioned. When a CU having a 32×32 size is verticallypartitioned into two CUs, the size of each of two partitioned CUs may be16×32. When a CU having a 32×32 size is horizontally partitioned intotwo CUs, the size of each of two partitioned CUs may be 32×16. When asingle CU is partitioned into two CUs, it may be considered that the CUhas been partitioned in a binary-tree structure.

Both of quad-tree partitioning and binary-tree partitioning are appliedto the LCU 310 of FIG. 3.

In the encoding apparatus 100, a Coding Tree Unit (CTU) having a size of64×64 may be partitioned into multiple smaller CUs by a recursivequad-tree structure. A single CU may be partitioned into four CUs havingthe same size. Each CU may be recursively partitioned, and may have aquad-tree structure.

By the recursive partitioning of a CU, an optimal partitioning methodthat incurs a minimum rate-distortion cost may be selected.

FIG. 4 is a diagram illustrating the form of a Prediction Unit (PU) thata Coding Unit (CU) can include.

When, among CUs partitioned from an LCU, a CU, which is not partitionedany further, may be divided into one or more Prediction Units (PUs).Such division is also referred to as “partitioning”.

A PU may be a base unit for prediction. A PU may be encoded and decodedin any one of a skip mode, an inter mode, and an intra mode. A PU may bepartitioned into various shapes depending on respective modes. Forexample, the target block, described above with reference to FIG. 1, andthe target block, described above with reference to FIG. 2, may each bea PU.

A CU may not be split into PUs. When the CU is not split into PUs, thesize of the CU and the size of a PU may be equal to each other.

In a skip mode, partitioning may not be present in a CU. In the skipmode, a 2N×2N mode 410, in which the sizes of a PU and a CU areidentical to each other, may be supported without partitioning.

In an inter mode, 8 types of partition shapes may be present in a CU.For example, in the inter mode, the 2N×2N mode 410, a 2N×N mode 415, anN×2N mode 420, an N×N mode 425, a 2N×nU mode 430, a 2N×nD mode 435, annL×2N mode 440, and an nR×2N mode 445 may be supported.

In an intra mode, the 2N×2N mode 410 and the N×N mode 425 may besupported.

In the 2N×2N mode 410, a PU having a size of 2N×2N may be encoded. ThePU having a size of 2N×2N may mean a PU having a size identical to thatof the CU. For example, the PU having a size of 2N×2N may have a size of64×64, 32×32, 16×16 or 8×8.

In the N×N mode 425, a PU having a size of N×N may be encoded.

For example, in intra prediction, when the size of a PU is 8×8, fourpartitioned PUs may be encoded. The size of each partitioned PU may be4×4.

When a PU is encoded in an intra mode, the PU may be encoded using anyone of multiple intra-prediction modes. For example, HEVC technology mayprovide 35 intra-prediction modes, and the PU may be encoded in any oneof the 35 intra-prediction modes.

Which one of the 2N×2N mode 410 and the N×N mode 425 is to be used toencode the PU may be determined based on rate-distortion cost.

The encoding apparatus 100 may perform an encoding operation on a PUhaving a size of 2N×2N. Here, the encoding operation may be theoperation of encoding the PU in each of multiple intra-prediction modesthat can be used by the encoding apparatus 100. Through the encodingoperation, the optimal intra-prediction mode for a PU having a size of2N×2N may be derived. The optimal intra-prediction mode may be anintra-prediction mode in which a minimum rate-distortion cost occursupon encoding the PU having a size of 2N×2N, among multipleintra-prediction modes that can be used by the encoding apparatus 100.

Further, the encoding apparatus 100 may sequentially perform an encodingoperation on respective PUs obtained from N×N partitioning. Here, theencoding operation may be the operation of encoding a PU in each ofmultiple intra-prediction modes that can be used by the encodingapparatus 100. By means of the encoding operation, the optimalintra-prediction mode for the PU having a size of N×N may be derived.The optimal intra-prediction mode may be an intra-prediction mode inwhich a minimum rate-distortion cost occurs upon encoding the PU havinga size of N×N, among multiple intra-prediction modes that can be used bythe encoding apparatus 100.

The encoding apparatus 100 may determine which of a PU having a size of2N×2N and PUs having sizes of N×N to be encoded based on a comparison ofa rate-distortion cost of the PU having a size of 2N×2N and arate-distortion costs of the PUs having sizes of N×N.

A single CU may be partitioned into one or more PUs, and a PU may bepartitioned into multiple PUs.

For example, when a single PU is partitioned into four PUs, thehorizontal size and vertical size of each of four PUs generated bypartitioning may be half the horizontal size and the vertical size ofthe PU before being partitioned. When a PU having a 32×32 size ispartitioned into four PUs, the size of each of four partitioned PUs maybe 16×16. When a single PU is partitioned into four PUs, it may beconsidered that the PU has been partitioned in a quad-tree structure.

For example, when a single PU is partitioned into two PUs, thehorizontal size or the vertical size of each of two PUs generated bypartitioning may be half the horizontal size or the vertical size of thePU before being partitioned. When a PU having a 32×32 size is verticallypartitioned into two PUs, the size of each of two partitioned PUs may be16×32. When a PU having a 32×32 size is horizontally partitioned intotwo PUs, the size of each of two partitioned PUs may be 32×16. When asingle PU is partitioned into two PUs, it may be considered that the PUhas been partitioned in a binary-tree structure.

FIG. 5 is a diagram illustrating the form of a Transform Unit (TU) thatcan be included in a CU.

A Transform Unit (TU) may have a base unit that is used for a procedure,such as transform, quantization, inverse transform, dequantization,entropy encoding, and entropy decoding, in a CU.

A TU may have a square shape or a rectangular shape. A shape of a TU maybe determined based on a size and/or a shape of a CU.

Among CUs partitioned from the LCU, a CU which is not partitioned intoCUs any further may be partitioned into one or more TUs. Here, thepartition structure of a TU may be a quad-tree structure. For example,as shown in FIG. 5, a single CU 510 may be partitioned one or more timesdepending on the quad-tree structure. By means of this partitioning, thesingle CU 510 may be composed of TUs having various sizes.

It can be considered that when a single CU is split two or more times,the CU is recursively split. Through splitting, a single CU may becomposed of Transform Units (TUs) having various sizes.

Alternatively, a single CU may be split into one or more TUs based onthe number of vertical lines and/or horizontal lines that split the CU.

A CU may be split into symmetric TUs or asymmetric TUs. For splittinginto asymmetric TUs, information about the size and/or shape of each TUmay be signaled from the encoding apparatus 100 to the decodingapparatus 200. Alternatively, the size and/or shape of each TU may bederived from information about the size and/or shape of the CU.

A CU may not be split into TUs. When the CU is not split into TUs, thesize of the CU and the size of a TU may be equal to each other.

A single CU may be partitioned into one or more TUs, and a TU may bepartitioned into multiple TUs.

For example, when a single TU is partitioned into four TUs, thehorizontal size and vertical size of each of four TUs generated bypartitioning may be half the horizontal size and the vertical size ofthe TU before being partitioned. When a TU having a 32×32 size ispartitioned into four TUs, the size of each of four partitioned TUs maybe 16×16. When a single TU is partitioned into four TUs, it may beconsidered that the TU has been partitioned in a quad-tree structure.

For example, when a single TU is partitioned into two TUs, thehorizontal size or the vertical size of each of two TUs generated bypartitioning may be half the horizontal size or the vertical size of theTU before being partitioned. When a TU having a 32×32 size is verticallypartitioned into two TUs, the size of each of two partitioned TUs may be16×32. When a TU having a 32×32 size is horizontally partitioned intotwo TUs, the size of each of two partitioned TUs may be 32×16. When asingle TU is partitioned into two TUs, it may be considered that the TUhas been partitioned in a binary-tree structure.

In a way differing from that illustrated in FIG. 5, a CU may be split.

For example, a single CU may be split into three CUs. The horizontalsizes or vertical sizes of the three CUs generated from splitting may be¼, ½, and ¼, respectively, of the horizontal size or vertical size ofthe original CU before being split.

For example, when a CU having a 32×32 size is vertically split intothree CUs, the sizes of the three CUs generated from the splitting maybe 8×32, 16×32, and 8×32, respectively. In this way, when a single CU issplit into three CUs, it may be considered that the CU is split in theform of a ternary tree.

One of exemplary splitting forms, that is, quad-tree splitting, binarytree splitting, and ternary tree splitting, may be applied to thesplitting of a CU, and multiple splitting schemes may be combined andused together for splitting of a CU. Here, the case where multiplesplitting schemes are combined and used together may be referred to as“complex tree-format splitting”.

FIG. 6 illustrates the splitting of a block according to an example.

In a video encoding and/or decoding process, a target block may besplit, as illustrated in FIG. 6.

For splitting of the target block, an indicator indicating splitinformation may be signaled from the encoding apparatus 100 to thedecoding apparatus 200. The split information may be informationindicating how the target block is split.

The split information may be one or more of a split flag (hereinafterreferred to as “split_flag”), a quad-binary flag (hereinafter referredto as “QB_flag”), a quad-tree flag (hereinafter referred to as“quadtree_flag”), a binary tree flag (hereinafter referred to as“binarytree_flag”), and a binary type flag (hereinafter referred to as“Btype_flag”).

“split_flag” may be a flag indicating whether a block is split. Forexample, a split_flag value of 1 may indicate that the correspondingblock is split. A split_flag value of 0 may indicate that thecorresponding block is not split.

“QB_flag” may be a flag indicating which one of a quad-tree form and abinary tree form corresponds to the shape in which the block is split.For example, a QB_flag value of 0 may indicate that the block is splitin a quad-tree form. A QB_flag value of 1 may indicate that the block issplit in a binary tree form. Alternatively, a QB_flag value of 0 mayindicate that the block is split in a binary tree form. A QB_flag valueof 1 may indicate that the block is split in a quad-tree form.

“quadtree_flag” may be a flag indicating whether a block is split in aquad-tree form. For example, a quadtree_flag value of 1 may indicatethat the block is split in a quad-tree form. A quadtree_flag value of 0may indicate that the block is not split in a quad-tree form.

“binarytree_flag” may be a flag indicating whether a block is split in abinary tree form. For example, a binarytree_flag value of 1 may indicatethat the block is split in a binary tree form. A binarytree_flag valueof 0 may indicate that the block is not split in a binary tree form.

“Btype_flag” may be a flag indicating which one of a vertical split anda horizontal split corresponds to a split direction when a block issplit in a binary tree form. For example, a Btype_flag value of 0 mayindicate that the block is split in a horizontal direction. A Btype_flagvalue of 1 may indicate that a block is split in a vertical direction.Alternatively, a Btype_flag value of 0 may indicate that the block issplit in a vertical direction. A Btype_flag value of 1 may indicate thata block is split in a horizontal direction.

For example, the split information of the block in FIG. 6 may be derivedby signaling at least one of quadtree_flag, binarytree_flag, andBtype_flag, as shown in the following Table 1.

TABLE 1 quadtree_flag binarytree_flag Btype_flag 1 0 1 1 0 0 1 0 1 0 0 00 0 0 0 0 0 0 1 0 1 1 0 0 0 0 0

For example, the split information of the block in FIG. 6 may be derivedby signaling at least one of split_flag, QB_flag and Btype_flag, asshown in the following Table 2.

TABLE 2 split_flag QB_flag Btype_flag 1 0 1 1 1 0 0 1 0 1 1 0 0 0 0 0 01 1 0 1 1 0 0 0 0

The splitting method may be limited only to a quad-tree or to a binarytree depending on the size and/or shape of the block. When thislimitation is applied, split_flag may be a flag indicating whether ablock is split in a quad-tree form or a flag indicating whether a blockis split in a binary tree form. The size and shape of a block may bederived depending on the depth information of the block, and the depthinformation may be signaled from the encoding apparatus 100 to thedecoding apparatus 200.

When the size of a block falls within a specific range, only splittingin a quad-tree form may be possible. For example, the specific range maybe defined by at least one of a maximum block size and a minimum blocksize at which only splitting in a quad-tree form is possible.

Information indicating the maximum block size and the minimum block sizeat which only splitting in a quad-tree form is possible may be signaledfrom the encoding apparatus 100 to the decoding apparatus 200 through abitstream. Further, this information may be signaled for at least one ofunits such as a video, a sequence, a picture, and a slice (or asegment).

Alternatively, the maximum block size and/or the minimum block size maybe fixed sizes predefined by the encoding apparatus 100 and the decodingapparatus 200. For example, when the size of a block is above 64×64 andbelow 256×256, only splitting in a quad-tree form may be possible. Inthis case, split_flag may be a flag indicating whether splitting in aquad-tree form is performed.

When the size of a block falls within the specific range, only splittingin a binary tree form may be possible. For example, the specific rangemay be defined by at least one of a maximum block size and a minimumblock size at which only splitting in a binary tree form is possible.

Information indicating the maximum block size and/or the minimum blocksize at which only splitting in a binary tree form is possible may besignaled from the encoding apparatus 100 to the decoding apparatus 200through a bitstream. Further, this information may be signaled for atleast one of units such as a sequence, a picture, and a slice (or asegment).

Alternatively, the maximum block size and/or the minimum block size maybe fixed sizes predefined by the encoding apparatus 100 and the decodingapparatus 200. For example, when the size of a block is above 8×8 andbelow 16×16, only splitting in a binary tree form may be possible. Inthis case, split_flag may be a flag indicating whether splitting in abinary tree form is performed.

The splitting of a block may be limited by previous splitting. Forexample, when a block is split in a binary tree form and multiplepartition blocks are generated, each partition block may be additionallysplit only in a binary tree form.

When the horizontal size or vertical size of a partition block is a sizethat cannot be split further, the above-described indicator may not besignaled.

FIG. 7 is a diagram for explaining an embodiment of an intra-predictionprocess.

Arrows radially extending from the center of the graph in FIG. 7indicate the prediction directions of intra-prediction modes. Further,numbers appearing near the arrows indicate examples of mode valuesassigned to intra-prediction modes or to the prediction directions ofthe intra-prediction modes.

Intra encoding and/or decoding may be performed using reference samplesof blocks neighboring a target block. The neighboring blocks may beneighboring reconstructed blocks. For example, intra encoding and/ordecoding may be performed using the values of reference samples whichare included in each neighboring reconstructed block or the codingparameters of the neighboring reconstructed block.

The encoding apparatus 100 and/or the decoding apparatus 200 maygenerate a prediction block by performing intra prediction on a targetblock based on information about samples in a target image. When intraprediction is performed, the encoding apparatus 100 and/or the decodingapparatus 200 may generate a prediction block for the target block byperforming intra prediction based on information about samples in thetarget image. When intra prediction is performed, the encoding apparatus100 and/or the decoding apparatus 200 may perform directional predictionand/or non-directional prediction based on at least one reconstructedreference sample.

A prediction block may be a block generated as a result of performingintra prediction. A prediction block may correspond to at least one of aCU, a PU, and a TU.

The unit of a prediction block may have a size corresponding to at leastone of a CU, a PU, and a TU. The prediction block may have a squareshape having a size of 2N×2N or N×N. The size of N×N may include sizesof 4×4, 8×8, 16×16, 32×32, 64×64, or the like.

Alternatively, a prediction block may a square block having a size of2×2, 4×4, 8×8, 16×16, 32×32, 64×64 or the like or a rectangular blockhaving a size of 2×8, 4×8, 2×16, 4×16, 8×16, or the like.

Intra prediction may be performed in consideration of theintra-prediction mode for the target block. The number ofintra-prediction modes that the target block can have may be apredefined fixed value, and may be a value determined differentlydepending on the attributes of a prediction block. For example, theattributes of the prediction block may include the size of theprediction block, the type of prediction block, etc.

For example, the number of intra-prediction modes may be fixed at 35regardless of the size of a prediction block. Alternatively, the numberof intra-prediction modes may be, for example, 3, 5, 9, 17, 34, 35, or36.

The intra-prediction modes may be non-directional modes or directionalmodes. For example, the intra-prediction modes may include twonon-directional modes and 33 directional modes, as shown in FIG. 7.

The two non-directional modes may include a DC mode and a planar mode.

The directional modes may be prediction modes having a specificdirection or a specific angle.

The intra-prediction modes may each be represented by at least one of amode number, a mode value, and a mode angle. The number ofintra-prediction modes may be M. The value of M may be 1 or more. Inother words, the number of intra-prediction modes may be M, whichincludes the number of non-directional modes and the number ofdirectional modes.

The number of intra-prediction modes may be fixed to M regardless of thesize and/or the color component of a block. For example, the number ofintra-prediction modes may be fixed at any one of 35 and 67 regardlessof the size of a block.

Alternatively, the number of intra-prediction modes may differ dependingon the size of a block and/or the type of color component.

For example, the larger the size of the block, the greater the number ofintra-prediction modes. Alternatively, the larger the size of the block,the smaller the number of intra-prediction modes. When the size of theblock is 4×4 or 8×8, the number of intra-prediction modes may be 67.When the size of the block is 16×16, the number of intra-predictionmodes may be 35. When the size of the block is 32×32, the number ofintra-prediction modes may be 19. When the size of a block is 64×64, thenumber of intra-prediction modes may be 7.

For example, the number of intra prediction modes may differ dependingon whether a color component is a luma signal or a chroma signal.Alternatively, the number of intra-prediction modes corresponding to aluma component block may be greater than the number of intra-predictionmodes corresponding to a chroma component block.

For example, in a vertical mode having a mode value of 26, predictionmay be performed in a vertical direction based on the pixel value of areference sample. For example, in a horizontal mode having a mode valueof 10, prediction may be performed in a horizontal direction based onthe pixel value of a reference sample.

Even in directional modes other than the above-described mode, theencoding apparatus 100 and the decoding apparatus 200 may perform intraprediction on a target unit using reference samples depending on anglescorresponding to the directional modes.

Intra-prediction modes located on a right side with respect to thevertical mode may be referred to as ‘vertical-right modes’.Intra-prediction modes located below the horizontal mode may be referredto as ‘horizontal-below modes’. For example, in FIG. 7, theintra-prediction modes in which a mode value is one of 27, 28, 29, 30,31, 32, 33, and 34 may be vertical-right modes 613. Intra-predictionmodes in which a mode value is one of 2, 3, 4, 5, 6, 7, 8, and 9 may behorizontal-below modes 616.

The non-directional mode may include a DC mode and a planar mode. Forexample, a value of the DC mode may be 1. A value of the planar mode maybe 0.

The directional mode may include an angular mode. Among the plurality ofthe intra prediction modes, remaining modes except for the DC mode andthe planar mode may be directional modes.

When the intra-prediction mode is a DC mode, a prediction block may begenerated based on the average of pixel values of a plurality ofreference pixels. For example, a value of a pixel of a prediction blockmay be determined based on the average of pixel values of a plurality ofreference pixels.

The number of above-described intra-prediction modes and the mode valuesof respective intra-prediction modes are merely exemplary. The number ofabove-described intra-prediction modes and the mode values of respectiveintra-prediction modes may be defined differently depending on theembodiments, implementation and/or requirements.

In order to perform intra prediction on a target block, the step ofchecking whether samples included in a reconstructed neighboring blockcan be used as reference samples of a target block may be performed.When a sample that cannot be used as a reference sample of the targetblock is present among samples in the neighboring block, a valuegenerated via copying and/or interpolation that uses at least one samplevalue, among the samples included in the reconstructed neighboringblock, may replace the sample value of the sample that cannot be used asthe reference sample. When the value generated via copying and/orinterpolation replaces the sample value of the existing sample, thesample may be used as the reference sample of the target block.

In intra prediction, a filter may be applied to at least one of areference sample and a prediction sample based on at least one of theintra-prediction mode and the size of the target block.

The type of filter to be applied to at least one of a reference sampleand a prediction sample may differ depending on at least one of theintra-prediction mode of a target block, the size of the target block,and the shape of the target block. The types of filters may beclassified depending on one or more of the number of filter taps, thevalue of a filter coefficient, and filter strength.

When the intra-prediction mode is a planar mode, a sample value of aprediction target block may be generated using a weighted sum of anabove reference sample of the target block, a left reference sample ofthe target block, an above-right reference sample of the target block,and a below-left reference sample of the target block depending on thelocation of the prediction target sample in the prediction block whenthe prediction block of the target block is generated.

When the intra-prediction mode is a DC mode, the average of referencesamples above the target block and the reference samples to the left ofthe target block may be used when the prediction block of the targetblock is generated. Also, filtering using the values of referencesamples may be performed on specific rows or specific columns in thetarget block. The specific rows may be one or more upper rows adjacentto the reference sample. The specific columns may be one or more leftcolumns adjacent to the reference sample.

When the intra-prediction mode is a directional mode, a prediction blockmay be generated using the above reference samples, left referencesamples, above-right reference sample and/or below-left reference sampleof the target block.

In order to generate the above-described prediction sample,real-number-based interpolation may be performed.

The intra-prediction mode of the target block may be predicted fromintra prediction mode of a neighboring block adjacent to the targetblock, and the information used for prediction may beentropy-encoded/decoded.

For example, when the intra-prediction modes of the target block and theneighboring block are identical to each other, it may be signaled, usinga predefined flag, that the intra-prediction modes of the target blockand the neighboring block are identical.

For example, an indicator for indicating an intra-prediction modeidentical to that of the target block, among intra-prediction modes ofmultiple neighboring blocks, may be signaled.

When the intra-prediction modes of the target block and a neighboringblock are different from each other, information about theintra-prediction mode of the target block may be encoded and/or decodedusing entropy encoding and/or decoding.

FIG. 8 is a diagram for explaining the locations of reference samplesused in an intra-prediction procedure.

FIG. 8 illustrates the locations of reference samples used for intraprediction of a target block. Referring to FIG. 8, reconstructedreference samples used for intra prediction of the target block mayinclude below-left reference samples 831, left reference samples 833, anabove-left corner reference sample 835, above reference samples 837, andabove-right reference samples 839.

For example, the left reference samples 833 may mean reconstructedreference pixels adjacent to the left side of the target block. Theabove reference samples 837 may mean reconstructed reference pixelsadjacent to the top of the target block. The above-left corner referencesample 835 may mean a reconstructed reference pixel located at theabove-left corner of the target block. The below-left reference samples831 may mean reference samples located below a left sample line composedof the left reference samples 833, among samples located on the sameline as the left sample line. The above-right reference samples 839 maymean reference samples located to the right of an above sample linecomposed of the above reference samples 837, among samples located onthe same line as the above sample line.

When the size of a target block is N×N, the numbers of the below-leftreference samples 831, the left reference samples 833, the abovereference samples 837, and the above-right reference samples 839 mayeach be N.

By performing intra prediction on the target block, a prediction blockmay be generated. The generation of the prediction block may include thedetermination of the values of pixels in the prediction block. The sizesof the target block and the prediction block may be equal.

The reference samples used for intra prediction of the target block mayvary depending on the intra-prediction mode of the target block. Thedirection of the intra-prediction mode may represent a dependencerelationship between the reference samples and the pixels of theprediction block. For example, the value of a specified reference samplemay be used as the values of one or more specified pixels in theprediction block. In this case, the specified reference sample and theone or more specified pixels in the prediction block may be the sampleand pixels which are positioned in a straight line in the direction ofan intra-prediction mode. In other words, the value of the specifiedreference sample may be copied as the value of a pixel located in adirection reverse to the direction of the intra-prediction mode.Alternatively, the value of a pixel in the prediction block may be thevalue of a reference sample located in the direction of theintra-prediction mode with respect to the location of the pixel.

In an example, when the intra-prediction mode of a target block is avertical mode having a mode value of 26, the above reference samples 837may be used for intra prediction. When the intra-prediction mode is thevertical mode, the value of a pixel in the prediction block may be thevalue of a reference sample vertically located above the location of thepixel. Therefore, the above reference samples 837 adjacent to the top ofthe target block may be used for intra prediction. Furthermore, thevalues of pixels in one row of the prediction block may be identical tothose of the above reference samples 837.

In an example, when the intra-prediction mode of a target block is ahorizontal mode having a mode value of 10, the left reference samples833 may be used for intra prediction. When the intra-prediction mode isthe horizontal mode, the value of a pixel in the prediction block may bethe value of a reference sample horizontally located left to thelocation of the pixel. Therefore, the left reference samples 833adjacent to the left of the target block may be used for intraprediction. Furthermore, the values of pixels in one column of theprediction block may be identical to those of the left reference samples833.

In an example, when the mode value of the intra-prediction mode of thecurrent block is 18, at least some of the left reference samples 833,the above-left corner reference sample 835, and at least some of theabove reference samples 837 may be used for intra prediction. When themode value of the intra-prediction mode is 18, the value of a pixel inthe prediction block may be the value of a reference sample diagonallylocated at the above-left corner of the pixel.

Further, At least a part of the above-right reference samples 839 may beused for intra prediction in a case that a intra prediction mode havinga mode value of 27, 28, 29, 30, 31, 32, 33 or 34 is used.

Further, At least a part of the below-left reference samples 831 may beused for intra prediction in a case that a intra prediction mode havinga mode value of 2, 3, 4, 5, 6, 7, 8 or 9 is used.

Further, the above-left corner reference sample 835 may be used forintra prediction in a case that a intra prediction mode of which a modevalue is a value ranging from 11 to 25.

The number of reference samples used to determine the pixel value of onepixel in the prediction block may be either 1, or 2 or more.

As described above, the pixel value of a pixel in the prediction blockmay be determined depending on the location of the pixel and thelocation of a reference sample indicated by the direction of theintra-prediction mode. When the location of the pixel and the locationof the reference sample indicated by the direction of theintra-prediction mode are integer positions, the value of one referencesample indicated by an integer position may be used to determine thepixel value of the pixel in the prediction block.

When the location of the pixel and the location of the reference sampleindicated by the direction of the intra-prediction mode are not integerpositions, an interpolated reference sample based on two referencesamples closest to the location of the reference sample may begenerated. The value of the interpolated reference sample may be used todetermine the pixel value of the pixel in the prediction block. In otherwords, when the location of the pixel in the prediction block and thelocation of the reference sample indicated by the direction of theintra-prediction mode indicate the location between two referencesamples, an interpolated value based on the values of the two samplesmay be generated.

The prediction block generated via prediction may not be identical to anoriginal target block. In other words, there may be a prediction errorwhich is the difference between the target block and the predictionblock, and there may also be a prediction error between the pixel of thetarget block and the pixel of the prediction block.

Hereinafter, the terms “difference”, “error”, and “residual” may be usedto have the same meaning, and may be used interchangeably with eachother.

For example, in the case of directional intra prediction, the longer thedistance between the pixel of the prediction block and the referencesample, the greater the prediction error that may occur. Such aprediction error may result in discontinuity between the generatedprediction block and neighboring blocks.

In order to reduce the prediction error, filtering for the predictionblock may be used. Filtering may be configured to adaptively apply afilter to an area, regarded as having a large prediction error, in theprediction block. For example, the area regarded as having a largeprediction error may be the boundary of the prediction block. Further,an area regarded as having a large prediction error in the predictionblock may differ depending on the intra-prediction mode, and thecharacteristics of filters may also differ depending thereon.

FIG. 9 is a diagram for explaining an embodiment of an inter predictionprocedure.

The rectangles shown in FIG. 9 may represent images (or pictures).Further, in FIG. 9, arrows may represent prediction directions. That is,each image may be encoded and/or decoded depending on the predictiondirection.

Images may be classified into an Intra Picture (I picture), aUni-prediction Picture or Predictive Coded Picture (P picture), and aBi-prediction Picture or Bi-predictive Coded Picture (B picture)depending on the encoding type. Each picture may be encoded and/ordecoded depending on the encoding type thereof.

When a target image that is the target to be encoded is an I picture,the target image may be encoded using data contained in the image itselfwithout inter prediction that refers to other images. For example, an Ipicture may be encoded only via intra prediction.

When a target image is a P picture, the target image may be encoded viainter prediction, which uses reference pictures existing in onedirection. Here, the one direction may be a forward direction or abackward direction.

When a target image is a B picture, the image may be encoded via interprediction that uses reference pictures existing in two directions, ormay be encoded via inter prediction that uses reference picturesexisting in one of a forward direction and a backward direction. Here,the two directions may be the forward direction and the backwarddirection.

A P picture and a B picture that are encoded and/or decoded usingreference pictures may be regarded as images in which inter predictionis used.

Below, inter prediction in an inter mode according to an embodiment willbe described in detail.

Inter prediction may be performed using motion information.

In an inter mode, the encoding apparatus 100 may perform interprediction and/or motion compensation on a target block. The decodingapparatus 200 may perform inter prediction and/or motion compensation,corresponding to inter prediction and/or motion compensation performedby the encoding apparatus 100, on a target block.

Motion information of the target block may be individually derived bythe encoding apparatus 100 and the decoding apparatus 200 during theinter prediction. The motion information may be derived using motioninformation of a reconstructed neighboring block, motion information ofa col block, and/or motion information of a block adjacent to the colblock.

For example, the encoding apparatus 100 or the decoding apparatus 200may perform prediction and/or motion compensation by using motioninformation of a spatial candidate and/or a temporal candidate as motioninformation of the target block. The target block may mean a PU and/or aPU partition.

A spatial candidate may be a reconstructed block which is spatiallyadjacent to the target block.

A temporal candidate may be a reconstructed block corresponding to thetarget block in a previously reconstructed co-located picture (colpicture).

In inter prediction, the encoding apparatus 100 and the decodingapparatus 200 may improve encoding efficiency and decoding efficiency byutilizing the motion information of a spatial candidate and/or atemporal candidate. The motion information of a spatial candidate may bereferred to as ‘spatial motion information’. The motion information of atemporal candidate may be referred to as ‘temporal motion information’.

Below, the motion information of a spatial candidate may be the motioninformation of a PU including the spatial candidate. The motioninformation of a temporal candidate may be the motion information of aPU including the temporal candidate. The motion information of acandidate block may be the motion information of a PU including thecandidate block.

Inter prediction may be performed using a reference picture.

The reference picture may be at least one of a picture previous to atarget picture and a picture subsequent to the target picture. Thereference picture may be an image used for the prediction of the targetblock.

In inter prediction, a region in the reference picture may be specifiedby utilizing a reference picture index (or refIdx) for indicating areference picture, a motion vector, which will be described later, etc.Here, the region specified in the reference picture may indicate areference block.

Inter prediction may select a reference picture, and may also select areference block corresponding to the target block from the referencepicture. Further, inter prediction may generate a prediction block forthe target block using the selected reference block.

The motion information may be derived during inter prediction by each ofthe encoding apparatus 100 and the decoding apparatus 200.

A spatial candidate may be a block 1) which is present in a targetpicture, 2) which has been previously reconstructed via encoding and/ordecoding, and 3) which is adjacent to the target block or is located atthe corner of the target block. Here, the “block located at the cornerof the target block” may be either a block vertically adjacent to aneighboring block that is horizontally adjacent to the target block, ora block horizontally adjacent to a neighboring block that is verticallyadjacent to the target block. Further, “block located at the corner ofthe target block” may have the same meaning as “block adjacent to thecorner of the target block”. The meaning of “block located at the cornerof the target block” may be included in the meaning of “block adjacentto the target block”.

For example, a spatial candidate may be a reconstructed block located tothe left of the target block, a reconstructed block located above thetarget block, a reconstructed block located at the below-left corner ofthe target block, a reconstructed block located at the above-rightcorner of the target block, or a reconstructed block located at theabove-left corner of the target block.

Each of the encoding apparatus 100 and the decoding apparatus 200 mayidentify a block present at the location spatially corresponding to thetarget block in a col picture. The location of the target block in thetarget picture and the location of the identified block in the colpicture may correspond to each other.

Each of the encoding apparatus 100 and the decoding apparatus 200 maydetermine a col block present at the predefined relative location forthe identified block to be a temporal candidate. The predefined relativelocation may be a location present inside and/or outside the identifiedblock.

For example, the col block may include a first col block and a secondcol block. When the coordinates of the identified block are (xP, yP) andthe size of the identified block is represented by (nPSW, nPSH), thefirst col block may be a block located at coordinates (xP+nPSW,yP+nPSH). The second col block may be a block located at coordinates(xP+(nPSW>>1), yP+(nPSH>>1)). The second col block may be selectivelyused when the first col block is unavailable.

The motion vector of the target block may be determined based on themotion vector of the col block. Each of the encoding apparatus 100 andthe decoding apparatus 200 may scale the motion vector of the col block.The scaled motion vector of the col block may be used as the motionvector of the target block. Further, a motion vector for the motioninformation of a temporal candidate stored in a list may be a scaledmotion vector.

The ratio of the motion vector of the target block to the motion vectorof the col block may be identical to the ratio of a first distance to asecond distance. The first distance may be the distance between thereference picture and the target picture of the target block. The seconddistance may be the distance between the reference picture and the colpicture of the col block.

The scheme for deriving motion information may change depending on theinter-prediction mode of a target block. For example, asinter-prediction modes applied for inter prediction, an Advanced MotionVector Predictor (AMVP) mode, a merge mode, a skip mode, a currentpicture reference mode, etc. may be present. The merge mode may also bereferred to as a “motion merge mode”. Individual modes will be describedin detail below.

1) AMVP Mode

When an AMVP mode is used, the encoding apparatus 100 may search aneighboring region of a target block for a similar block. The encodingapparatus 100 may acquire a prediction block by performing prediction onthe target block using motion information of the found similar block.The encoding apparatus 100 may encode a residual block, which is thedifference between the target block and the prediction block.

1-1) Creation of List of Prediction Motion Vector Candidates

When an AMVP mode is used as the prediction mode, each of the encodingapparatus 100 and the decoding apparatus 200 may create a list ofprediction motion vector candidates using the motion vector of a spatialcandidate, the motion vector of a temporal candidate, and a zero vector.The prediction motion vector candidate list may include one or moreprediction motion vector candidates. At least one of the motion vectorof a spatial candidate, the motion vector of a temporal candidate, and azero vector may be determined and used as a prediction motion vectorcandidate.

Hereinafter, the terms “prediction motion vector (candidate)” and“motion vector (candidate)” may be used to have the same meaning, andmay be used interchangeably with each other.

Hereinafter, the terms “prediction motion vector candidate” and “AMVPcandidate” may be used to have the same meaning, and may be usedinterchangeably with each other.

Hereinafter, the terms “prediction motion vector candidate list” and“AMVP candidate list” may be used to have the same meaning, and may beused interchangeably with each other.

Spatial candidates may include a reconstructed spatial neighboringblock. In other words, the motion vector of the reconstructedneighboring block may be referred to as a “spatial prediction motionvector candidate”.

Temporal candidates may include a col block and a block adjacent to thecol block. In other words, the motion vector of the col block or themotion vector of the block adjacent to the col block may be referred toas a “temporal prediction motion vector candidate”.

The zero vector may be a (0, 0) motion vector.

The prediction motion vector candidates may be motion vector predictorsfor predicting a motion vector. Also, in the encoding apparatus 100,each prediction motion vector candidate may be an initial searchlocation for a motion vector.

1-2) Search for Motion Vectors that Use List of Prediction Motion VectorCandidates

The encoding apparatus 100 may determine the motion vector to be used toencode a target block within a search range using a list of predictionmotion vector candidates. Further, the encoding apparatus 100 maydetermine a prediction motion vector candidate to be used as theprediction motion vector of the target block, among prediction motionvector candidates present in the prediction motion vector candidatelist.

The motion vector to be used to encode the target block may be a motionvector that can be encoded at minimum cost.

Further, the encoding apparatus 100 may determine whether to use theAMVP mode to encode the target block.

1-3) Transmission of Inter-Prediction Information

The encoding apparatus 100 may generate a bitstream includinginter-prediction information required for inter prediction. The decodingapparatus 200 may perform inter prediction on the target block using theinter-prediction information of the bitstream.

The inter-prediction information may contain 1) mode informationindicating whether an AMVP mode is used, 2) a prediction motion vectorindex, 3) a Motion Vector Difference (MVD), 4) a reference direction,and 5) a reference picture index.

Hereinafter, the terms “prediction motion vector index” and “AMVP index”may be used to have the same meaning, and may be used interchangeablywith each other.

Further, the inter-prediction information may contain a residual signal.

The decoding apparatus 200 may acquire a prediction motion vector index,an MVD, a reference direction, and a reference picture index from thebitstream through entropy decoding when mode information indicates thatthe AMVP mode is used.

The prediction motion vector index may indicate a prediction motionvector candidate to be used for the prediction of a target block, amongprediction motion vector candidates included in the prediction motionvector candidate list.

1-4) Inter Prediction in AMVP Mode that Uses Inter-PredictionInformation

The decoding apparatus 200 may derive prediction motion vectorcandidates using a prediction motion vector candidate list, and maydetermine the motion information of a target block based on the derivedprediction motion vector candidates.

The decoding apparatus 200 may determine a motion vector candidate forthe target block, among the prediction motion vector candidates includedin the prediction motion vector candidate list, using a predictionmotion vector index. The decoding apparatus 200 may select a predictionmotion vector candidate, indicated by the prediction motion vectorindex, from among prediction motion vector candidates included in theprediction motion vector candidate list, as the prediction motion vectorof the target block.

The motion vector to be actually used for inter prediction of the targetblock may not match the prediction motion vector. In order to indicatethe difference between the motion vector to be actually used for interprediction of the target block and the prediction motion vector, an MVDmay be used. The encoding apparatus 100 may derive a prediction motionvector similar to the motion vector to be actually used for interprediction of the target block so as to use an MVD that is as small aspossible.

An MVD may be the difference between the motion vector of the targetblock and the prediction motion vector. The encoding apparatus 100 maycalculate an MVD and may entropy-encode the MVD.

The MVD may be transmitted from the encoding apparatus 100 to thedecoding apparatus 200 through a bitstream. The decoding apparatus 200may decode the received MD. The decoding apparatus 200 may derive themotion vector of the target block by summing the decoded MVD and theprediction motion vector. In other words, the motion vector of thetarget block derived by the decoding apparatus 200 may be the sum of theentropy-decoded MVD and the motion vector candidate.

The reference direction may indicate a list of reference pictures to beused for prediction of the target block. For example, the referencedirection may indicate one of a reference picture list L0 and areference picture list L1.

The reference direction merely indicates the reference picture list tobe used for prediction of the target block, and may not mean that thedirections of reference pictures are limited to a forward direction or abackward direction. In other words, each of the reference picture listL0 and the reference picture list L1 may include pictures in a forwarddirection and/or a backward direction.

That the reference direction is unidirectional may mean that a singlereference picture list is used. That the reference direction isbidirectional may mean that two reference picture lists are used. Inother words, the reference direction may indicate one of the case whereonly the reference picture list L0 is used, the case where only thereference picture list L1 is used, and the case where two referencepicture lists are used.

The reference picture index may indicate a reference picture to be usedfor prediction of a target block, among reference pictures in thereference picture list. The reference picture index may beentropy-encoded by the encoding apparatus 100. The entropy-encodedreference picture index may be signaled to the decoding apparatus 200 bythe encoding apparatus 100 through a bitstream.

When two reference picture lists are used to predict the target block, asingle reference picture index and a single motion vector may be usedfor each of the reference picture lists. Further, when two referencepicture lists are used to predict the target block, two predictionblocks may be specified for the target block. For example, the (final)prediction block of the target block may be generated using the averageor weighted sum of the two prediction blocks for the target block.

The motion vector of the target block may be derived by the predictionmotion vector index, the MVD, the reference direction, and the referencepicture index.

The decoding apparatus 200 may generate a prediction block for thetarget block based on the derived motion vector and the referencepicture index. For example, the prediction block may be a referenceblock, indicated by the derived motion vector, in the reference pictureindicated by the reference picture index.

Since the prediction motion vector index and the MVD are encoded withoutthe motion vector itself of the target block being encoded, the numberof bits transmitted from the encoding apparatus 100 to the decodingapparatus 200 may be decreased, and encoding efficiency may be improved.

For the target block, the motion information of reconstructedneighboring blocks may be used. In a specific inter-prediction mode, theencoding apparatus 100 may not separately encode the actual motioninformation of the target block. The motion information of the targetblock is not encoded, and additional information that enables the motioninformation of the target block to be derived using the motioninformation of reconstructed neighboring blocks may be encoded instead.As the additional information is encoded, the number of bits transmittedto the decoding apparatus 200 may be decreased, and encoding efficiencymay be improved.

For example, as inter-prediction modes in which the motion informationof the target block is not directly encoded, there may be a skip modeand/or a merge mode. Here, each of the encoding apparatus 100 and thedecoding apparatus 200 may use an identifier and/or an index thatindicates a unit, the motion information of which is to be used as themotion information of the target unit, among reconstructed neighboringunits.

2) Merge Mode

As a scheme for deriving the motion information of a target block, thereis merging. The term “merging” may mean the merging of the motion ofmultiple blocks. “Merging” may mean that the motion information of oneblock is also applied to other blocks. In other words, a merge mode maybe a mode in which the motion information of the target block is derivedfrom the motion information of a neighboring block.

When a merge mode is used, the encoding apparatus 100 may predict themotion information of a target block using the motion information of aspatial candidate and/or the motion information of a temporal candidate.The spatial candidate may include a reconstructed spatial neighboringblock that is spatially adjacent to the target block. The spatialneighboring block may include a left adjacent block and an aboveadjacent block. The temporal candidate may include a col block. Theterms “spatial candidate” and “spatial merge candidate” may be used tohave the same meaning, and may be used interchangeably with each other.The terms “temporal candidate” and “temporal merge candidate” may beused to have the same meaning, and may be used interchangeably with eachother.

The encoding apparatus 100 may acquire a prediction block viaprediction. The encoding apparatus 100 may encode a residual block,which is the difference between the target block and the predictionblock.

2-1) Creation of Merge Candidate List

When the merge mode is used, each of the encoding apparatus 100 and thedecoding apparatus 200 may create a merge candidate list using themotion information of a spatial candidate and/or the motion informationof a temporal candidate. The motion information may include 1) a motionvector, 2) a reference picture index, and 3) a reference direction. Thereference direction may be unidirectional or bidirectional.

The merge candidate list may include merge candidates. The mergecandidates may be motion information. In other words, the mergecandidate list may be a list in which pieces of motion information arestored.

The merge candidates may be pieces of motion information of temporalcandidates and/or spatial candidates. Further, the merge candidate listmay include new merge candidates generated by a combination of mergecandidates that are already present in the merge candidate list. Inother words, the merge candidate list may include new motion informationgenerated by a combination of pieces of motion information previouslypresent in the merge candidate list.

The merge candidates may be specific modes deriving inter predictioninformation. The merge candidate may be information indicating aspecific mode deriving inter prediction information. Inter predictioninformation of a target block may be derived according to a specificmode which the merge candidate indicates. Furthermore, the specific modemay include a process of deriving a series of inter predictioninformation. This specific mode may be an inter prediction informationderivation mode or a motion information derivation mode.

The inter prediction information of the target block may be derivedaccording to the mode indicated by the merge candidate selected by themerge index among the merge candidates in the merge candidate list

For example, the motion information derivation modes in the mergecandidate list may be at least one of 1) motion information derivationmode for a sub-block unit and 2) an affine motion information derivationmode.

Furthermore, the merge candidate list may include motion information ofa zero vector. The zero vector may also be referred to as a “zero-mergecandidate”.

In other words, pieces of motion information in the merge candidate listmay be at least one of 1) motion information of a spatial candidate, 2)motion information of a temporal candidate, 3) motion informationgenerated by a combination of pieces of motion information previouslypresent in the merge candidate list, and 4) a zero vector.

Motion information may include 1) a motion vector, 2) a referencepicture index, and 3) a reference direction. The reference direction mayalso be referred to as an “inter-prediction indicator”. The referencedirection may be unidirectional or bidirectional. The unidirectionalreference direction may indicate L0 prediction or L1 prediction.

The merge candidate list may be created before prediction in the mergemode is performed.

The number of merge candidates in the merge candidate list may bepredefined. Each of the encoding apparatus 100 and the decodingapparatus 200 may add merge candidates to the merge candidate listdepending on the predefined scheme and predefined priorities so that themerge candidate list has a predefined number of merge candidates. Themerge candidate list of the encoding apparatus 100 and the mergecandidate list of the decoding apparatus 200 may be made identical toeach other using the predefined scheme and the predefined priorities.

Merging may be applied on a CU basis or a PU basis. When merging isperformed on a CU basis or a PU basis, the encoding apparatus 100 maytransmit a bitstream including predefined information to the decodingapparatus 200. For example, the predefined information may contain 1)information indicating whether to perform merging for individual blockpartitions, and 2) information about a block with which merging is to beperformed, among blocks that are spatial candidates and/or temporalcandidates for the target block.

2-2) Search for Motion Vector that Uses Merge Candidate List

The encoding apparatus 100 may determine merge candidates to be used toencode a target block. For example, the encoding apparatus 100 mayperform prediction on the target block using merge candidates in themerge candidate list, and may generate residual blocks for the mergecandidates. The encoding apparatus 100 may use a merge candidate thatincurs the minimum cost in prediction and in the encoding of residualblocks to encode the target block.

Further, the encoding apparatus 100 may determine whether to use a mergemode to encode the target block.

2-3) Transmission of Inter-Prediction Information

The encoding apparatus 100 may generate a bitstream that includesinter-prediction information required for inter prediction. The encodingapparatus 100 may generate entropy-encoded inter-prediction informationby performing entropy encoding on inter-prediction information, and maytransmit a bitstream including the entropy-encoded inter-predictioninformation to the decoding apparatus 200. Through the bitstream, theentropy-encoded inter-prediction information may be signaled to thedecoding apparatus 200 by the encoding apparatus 100.

The decoding apparatus 200 may perform inter prediction on the targetblock using the inter-prediction information of the bitstream.

The inter-prediction information may contain 1) mode informationindicating whether a merge mode is used and 2) a merge index.

Further, the inter-prediction information may contain a residual signal.

The decoding apparatus 200 may acquire the merge index from thebitstream only when the mode information indicates that the merge modeis used.

The mode information may be a merge flag. The unit of the modeinformation may be a block. Information about the block may include modeinformation, and the mode information may indicate whether a merge modeis applied to the block.

The merge index may indicate a merge candidate to be used for theprediction of the target block, among merge candidates included in themerge candidate list. Alternatively, the merge index may indicate ablock with which the target block is to be merged, among neighboringblocks spatially or temporally adjacent to the target block.

The encoding apparatus 100 may select a merge candidate having thehighest encoding performance among the merge candidates included in themerge candidate list and set a value of the merge index to indicate theselected merge candidate.

2-4) Inter Prediction of Merge Mode that Uses Inter-PredictionInformation

The decoding apparatus 200 may perform prediction on the target blockusing the merge candidate indicated by the merge index, among mergecandidates included in the merge candidate list.

The motion vector of the target block may be specified by the motionvector, reference picture index, and reference direction of the mergecandidate indicated by the merge index.

3) Skip Mode

A skip mode may be a mode in which the motion information of a spatialcandidate or the motion information of a temporal candidate is appliedto the target block without change. Also, the skip mode may be a mode inwhich a residual signal is not used. In other words, when the skip modeis used, a reconstructed block may be a prediction block.

The difference between the merge mode and the skip mode lies in whetheror not a residual signal is transmitted or used. That is, the skip modemay be similar to the merge mode except that a residual signal is nottransmitted or used.

When the skip mode is used, the encoding apparatus 100 may transmitinformation about a block, the motion information of which is to be usedas the motion information of the target block, among blocks that arespatial candidates or temporal candidates, to the decoding apparatus 200through a bitstream. The encoding apparatus 100 may generateentropy-encoded information by performing entropy encoding on theinformation, and may signal the entropy-encoded information to thedecoding apparatus 200 through a bitstream.

Further, when the skip mode is used, the encoding apparatus 100 may nottransmit other syntax information, such as an MVD, to the decodingapparatus 200. For example, when the skip mode is used, the encodingapparatus 100 may not signal a syntax element related to at least one ofan MVC, a coded block flag, and a transform coefficient level to thedecoding apparatus 200.

3-1) Creation of Merge Candidate List

The skip mode may also use a merge candidate list. In other words, amerge candidate list may be used both in the merge mode and in the skipmode. In this aspect, the merge candidate list may also be referred toas a “skip candidate list” or a “merge/skip candidate list”.

Alternatively, the skip mode may use an additional candidate listdifferent from that of the merge mode. In this case, in the followingdescription, a merge candidate list and a merge candidate may bereplaced with a skip candidate list and a skip candidate, respectively.

The merge candidate list may be created before prediction in the skipmode is performed.

3-2) Search for Motion Vector that Uses Merge Candidate List

The encoding apparatus 100 may determine the merge candidates to be usedto encode a target block. For example, the encoding apparatus 100 mayperform prediction on the target block using the merge candidates in amerge candidate list. The encoding apparatus 100 may use a mergecandidate that incurs the minimum cost in prediction to encode thetarget block.

Further, the encoding apparatus 100 may determine whether to use a skipmode to encode the target block.

3-3) Transmission of Inter-Prediction Information

The encoding apparatus 100 may generate a bitstream that includesinter-prediction information required for inter prediction. The decodingapparatus 200 may perform inter prediction on the target block using theinter-prediction information of the bitstream.

The inter-prediction information may include 1) mode informationindicating whether a skip mode is used, and 2) a skip index.

The skip index may be identical to the above-described merge index.

When the skip mode is used, the target block may be encoded withoutusing a residual signal. The inter-prediction information may notcontain a residual signal. Alternatively, the bitstream may not includea residual signal.

The decoding apparatus 200 may acquire a skip index from the bitstreamonly when the mode information indicates that the skip mode is used. Asdescribed above, a merge index and a skip index may be identical to eachother. The decoding apparatus 200 may acquire the skip index from thebitstream only when the mode information indicates that the merge modeor the skip mode is used.

The skip index may indicate the merge candidate to be used for theprediction of the target block, among the merge candidates included inthe merge candidate list.

3-4) Inter Prediction in Skip Mode that Uses Inter-PredictionInformation

The decoding apparatus 200 may perform prediction on the target blockusing a merge candidate indicated by a skip index, among the mergecandidates included in a merge candidate list.

The motion vector of the target block may be specified by the motionvector, reference picture index, and reference direction of the mergecandidate indicated by the skip index.

4) Current Picture Reference Mode

The current picture reference mode may denote a prediction mode thatuses a previously reconstructed region in a target picture to which atarget block belongs.

A motion vector for specifying the previously reconstructed region maybe used. Whether the target block has been encoded in the currentpicture reference mode may be determined using the reference pictureindex of the target block.

A flag or index indicating whether the target block is a block encodedin the current picture reference mode may be signaled by the encodingapparatus 100 to the decoding apparatus 200. Alternatively, whether thetarget block is a block encoded in the current picture reference modemay be inferred through the reference picture index of the target block.

When the target block is encoded in the current picture reference mode,the target picture may exist at a fixed location or an arbitrarylocation in a reference picture list for the target block.

For example, the fixed location may be either a location where a valueof the reference picture index is 0 or the last location.

When the target picture exists at an arbitrary location in the referencepicture list, an additional reference picture index indicating such anarbitrary location may be signaled by the encoding apparatus 100 to thedecoding apparatus 200.

In the above-described AMVP mode, merge mode, and skip mode, motioninformation to be used for the prediction of a target block may bespecified, among pieces of motion information in the list, using theindex of the list.

In order to improve encoding efficiency, the encoding apparatus 100 maysignal only the index of an element that incurs the minimum cost ininter prediction of the target block, among elements in the list. Theencoding apparatus 100 may encode the index, and may signal the encodedindex.

Therefore, the above-described lists (i.e. the prediction motion vectorcandidate list and the merge candidate list) must be able to be derivedby the encoding apparatus 100 and the decoding apparatus 200 using thesame scheme based on the same data. Here, the same data may include areconstructed picture and a reconstructed block. Further, in order tospecify an element using an index, the order of the elements in the listmust be fixed.

FIG. 10 illustrates spatial candidates according to an embodiment.

In FIG. 10, the locations of spatial candidates are illustrated.

The large block in the center of the drawing may denote a target block.Five small blocks may denote spatial candidates.

The coordinates of the target block may be (xP, yP), and the size of thetarget block may be represented by (nPSW, nPSH).

Spatial candidate A₀ may be a block adjacent to the below-left corner ofthe target block. A₀ may be a block that occupies pixels located atcoordinates (xP−1, yP+nPSH+1).

Spatial candidate A₁ may be a block adjacent to the left of the targetblock. A₁ may be a lowermost block, among blocks adjacent to the left ofthe target block. Alternatively, A₁ may be a block adjacent to the topof A₀. A₁ may be a block that occupies pixels located at coordinates(xP−1, yP+nPSH).

Spatial candidate B₀ may be a block adjacent to the above-right cornerof the target block. B₀ may be a block that occupies pixels located atcoordinates (xP+nPSW+1, yP−1).

Spatial candidate B₁ may be a block adjacent to the top of the targetblock. B₁ may be a rightmost block, among blocks adjacent to the top ofthe target block. Alternatively, B₁ may be a block adjacent to the leftof B₀. B₁ may be a block that occupies pixels located at coordinates(xP+nPSW, yP−1).

Spatial candidate B₂ may be a block adjacent to the above-left corner ofthe target block. B₂ may be a block that occupies pixels located atcoordinates (xP−1, yP−1).

Determination of Availability of Spatial Candidate and TemporalCandidate

In order to include the motion information of a spatial candidate or themotion information of a temporal candidate in a list, it must bedetermined whether the motion information of the spatial candidate orthe motion information of the temporal candidate is available.

Hereinafter, a candidate block may include a spatial candidate and atemporal candidate.

For example, the determination may be performed by sequentially applyingthe following steps 1) to 4).

Step 1) When a PU including a candidate block is out of the boundary ofa picture, the availability of the candidate block may be set to“false”. The expression “availability is set to false” may have the samemeaning as “set to be unavailable”.

Step 2) When a PU including a candidate block is out of the boundary ofa slice, the availability of the candidate block may be set to “false”.When the target block and the candidate block are located in differentslices, the availability of the candidate block may be set to “false”.

Step 3) When a PU including a candidate block is out of the boundary ofa tile, the availability of the candidate block may be set to “false”.When the target block and the candidate block are located in differenttiles, the availability of the candidate block may be set to “false”.

Step 4) When the prediction mode of a PU including a candidate block isan intra-prediction mode, the availability of the candidate block may beset to “false”. When a PU including a candidate block does not use interprediction, the availability of the candidate block may be set to“false”.

FIG. 11 illustrates the order of addition of motion information ofspatial candidates to a merge list according to an embodiment.

As shown in FIG. 11, when pieces of motion information of spatialcandidates are added to a merge list, the order of A₁, B₁, B₀, A₀, andB₂ may be used. That is, pieces of motion information of availablespatial candidates may be added to the merge list in the order of A₁,B₁, B₀, A₀, and B₂.

Method for Deriving Merge List in Merge Mode and Skip Mode

As described above, the maximum number of merge candidates in the mergelist may be set. The set maximum number is indicated by “N”. The setnumber may be transmitted from the encoding apparatus 100 to thedecoding apparatus 200. The slice header of a slice may include N. Inother words, the maximum number of merge candidates in the merge listfor the target block of the slice may be set by the slice header. Forexample, the value of N may be basically 5.

Pieces of motion information (i.e., merge candidates) may be added tothe merge list in the order of the following steps 1) to 4).

Step 1) Among spatial candidates, available spatial candidates may beadded to the merge list. Pieces of motion information of the availablespatial candidates may be added to the merge list in the orderillustrated in FIG. 10. Here, when the motion information of anavailable spatial candidate overlaps other motion information alreadypresent in the merge list, the motion information may not be added tothe merge list. The operation of checking whether the correspondingmotion information overlaps other motion information present in the listmay be referred to in brief as an “overlap check”.

The maximum number of pieces of motion information that are added may beN.

Step 2) When the number of pieces of motion information in the mergelist is less than N and a temporal candidate is available, the motioninformation of the temporal candidate may be added to the merge list.Here, when the motion information of the available temporal candidateoverlaps other motion information already present in the merge list, themotion information may not be added to the merge list.

Step 3) When the number of pieces of motion information in the mergelist is less than N and the type of a target slice is “B”, combinedmotion information generated by combined bidirectional prediction(bi-prediction) may be added to the merge list.

The target slice may be a slice including a target block.

The combined motion information may be a combination of L0 motioninformation and L1 motion information. L0 motion information may bemotion information that refers only to a reference picture list L0. L1motion information may be motion information that refers only to areference picture list L1.

In the merge list, one or more pieces of L0 motion information may bepresent. Further, in the merge list, one or more pieces of L1 motioninformation may be present.

The combined motion information may include one or more pieces ofcombined motion information. When the combined motion information isgenerated, L0 motion information and L1 motion information, which are tobe used for generation, among the one or more pieces of L0 motioninformation and the one or more pieces of L1 motion information, may bepredefined. One or more pieces of combined motion information may begenerated in a predefined order via combined bidirectional prediction,which uses a pair of different pieces of motion information in the mergelist. One of the pair of different pieces of motion information may beL0 motion information and the other of the pair may be L1 motioninformation.

For example, combined motion information that is added with the highestpriority may be a combination of L0 motion information having a mergeindex of 0 and L1 motion information having a merge index of 1. Whenmotion information having a merge index of 0 is not L0 motioninformation or when motion information having a merge index of 1 is notL1 motion information, the combined motion information may be neithergenerated nor added. Next, the combined motion information that is addedwith the next priority may be a combination of L0 motion information,having a merge index of 1, and L1 motion information, having a mergeindex of 0. Subsequent detailed combinations may conform to othercombinations of video encoding/decoding fields.

Here, when the combined motion information overlaps other motioninformation already present in the merge list, the combined motioninformation may not be added to the merge list.

Step 4) When the number of pieces of motion information in the mergelist is less than N, motion information of a zero vector may be added tothe merge list.

The zero-vector motion information may be motion information for whichthe motion vector is a zero vector.

The number of pieces of zero-vector motion information may be one ormore. The reference picture indices of one or more pieces of zero-vectormotion information may be different from each other. For example, thevalue of the reference picture index of first zero-vector motioninformation may be 0. The value of the reference picture index of secondzero-vector motion information may be 1.

The number of pieces of zero-vector motion information may be identicalto the number of reference pictures in the reference picture list.

The reference direction of zero-vector motion information may bebidirectional. Both of the motion vectors may be zero vectors. Thenumber of pieces of zero-vector motion information may be the smallerone of the number of reference pictures in the reference picture list L0and the number of reference pictures in the reference picture list L1.Alternatively, when the number of reference pictures in the referencepicture list L0 and the number of reference pictures in the referencepicture list L1 are different from each other, a reference directionthat is unidirectional may be used for a reference picture index thatmay be applied only to a single reference picture list.

The encoding apparatus 100 and/or the decoding apparatus 200 maysequentially add the zero-vector motion information to the merge listwhile changing the reference picture index.

When zero-vector motion information overlaps other motion informationalready present in the merge list, the zero-vector motion informationmay not be added to the merge list.

The order of the above-described steps 1) to 4) is merely exemplary, andmay be changed. Further, some of the above steps may be omitteddepending on predefined conditions.

Method for Deriving Prediction Motion Vector Candidate List in AMVP Mode

The maximum number of prediction motion vector candidates in aprediction motion vector candidate list may be predefined. Thepredefined maximum number is indicated by N. For example, the predefinedmaximum number may be 2.

Pieces of motion information (i.e. prediction motion vector candidates)may be added to the prediction motion vector candidate list in the orderof the following steps 1) to 3).

Step 1) Available spatial candidates, among spatial candidates, may beadded to the prediction motion vector candidate list. The spatialcandidates may include a first spatial candidate and a second spatialcandidate.

The first spatial candidate may be one of A₀, A₁, scaled A₀, and scaledA₁. The second spatial candidate may be one of B₀, B₁, B₂, scaled B₀,scaled B₁, and scaled B₂.

Pieces of motion information of available spatial candidates may beadded to the prediction motion vector candidate list in the order of thefirst spatial candidate and the second spatial candidate. In this case,when the motion information of an available spatial candidate overlapsother motion information already present in the prediction motion vectorcandidate list, the motion information may not be added to theprediction motion vector candidate list. In other words, when the valueof N is 2, if the motion information of a second spatial candidate isidentical to the motion information of a first spatial candidate, themotion information of the second spatial candidate may not be added tothe prediction motion vector candidate list.

The maximum number of pieces of motion information that are added may beN.

Step 2) When the number of pieces of motion information in theprediction motion vector candidate list is less than N and a temporalcandidate is available, the motion information of the temporal candidatemay be added to the prediction motion vector candidate list. In thiscase, when the motion information of the available temporal candidateoverlaps other motion information already present in the predictionmotion vector candidate list, the motion information may not be added tothe prediction motion vector candidate list.

Step 3) When the number of pieces of motion information in theprediction motion vector candidate list is less than N, zero-vectormotion information may be added to the prediction motion vectorcandidate list.

The zero-vector motion information may include one or more pieces ofzero-vector motion information. The reference picture indices of the oneor more pieces of zero-vector motion information may be different fromeach other.

The encoding apparatus 100 and/or the decoding apparatus 200 maysequentially add pieces of zero-vector motion information to theprediction motion vector candidate list while changing the referencepicture index.

When zero-vector motion information overlaps other motion informationalready present in the prediction motion vector candidate list, thezero-vector motion information may not be added to the prediction motionvector candidate list.

The description of the zero-vector motion information, made above inconnection with the merge list, may also be applied to zero-vectormotion information. A repeated description thereof will be omitted.

The order of the above-described steps 1) to 3) is merely exemplary, andmay be changed. Further, some of the steps may be omitted depending onpredefined conditions.

FIG. 12 illustrates a transform and quantization process according to anexample.

As illustrated in FIG. 12, quantized levels may be generated byperforming a transform and/or quantization process on a residual signal.

A residual signal may be generated as the difference between an originalblock and a prediction block. Here, the prediction block may be a blockgenerated via intra prediction or inter prediction.

The residual signal may be transformed into a signal in a frequencydomain through a transform procedure that is a part of a quantizationprocedure.

A transform kernel used for a transform may include various DCT kernels,such as Discrete Cosine Transform (DCT) type 2 (DCT-II) and DiscreteSine Transform (DST) kernels.

These transform kernels may perform a separable transform or atwo-dimensional (2D) non-separable transform on the residual signal. Theseparable transform may be a transform indicating that a one-dimensional(1D) transform is performed on the residual signal in each of ahorizontal direction and a vertical direction.

The DCT type and the DST type, which are adaptively used for a 1Dtransform, may include DCT-V, DCT-VIII, DST-I, and DST-VII in additionto DCT-II, as shown in the following Table 3 and the following table 4.

TABLE 3 Transform set Transform candidates 0 DST-VII, DCT-VIII 1DST-VII, DST-I 2 DST-VII, DCT-V

TABLE 4 Transform set Transform candidates 0 DST-VII, DCT-VIII, DST-I 1DST-VII, DST-I, DCT-VIII 2 DST-VII, DCT-V, DST-I

As shown in Table 3, when a DCT type or a DST type to be used for atransform is derived, transform sets may be used. Each transform set mayinclude multiple transform candidates. Each transform candidate may be aDCT type or a DST type.

The following Table 5 shows examples of a transform set to be applied toa horizontal direction and a transform set to be applied to a verticaldirection depending on intra-prediction modes.

TABLE 5 Intra-prediction mode 0 1 2 3 4 5 6 7 8 9 Vertical 2 1 0 1 0 1 01 0 1 transform set Horizontal 2 1 0 1 0 1 0 1 0 1 transform setIntra-prediction mode 10 11 12 13 14 15 16 17 18 19 Vertical 0 1 0 1 0 00 0 0 0 transform set Horizontal 0 1 0 1 2 2 2 2 2 2 transform setIntra-prediction mode 20 21 22 23 24 25 26 27 28 29 Vertical 0 0 0 1 0 10 1 0 1 transform set Horizontal 2 2 2 1 0 1 0 1 0 1 transform setIntra-prediction mode 30 31 32 33 34 35 36 37 38 39 Vertical 0 1 0 1 0 10 1 0 1 transform set Horizontal 0 1 0 1 0 1 0 1 0 1 transform setIntra-prediction mode 40 41 42 43 44 45 46 47 48 49 Vertical 0 1 0 1 0 12 2 2 2 transform set Horizontal 0 1 0 1 0 1 0 0 0 0 transform setIntra-prediction mode 50 51 52 53 54 55 56 57 58 59 Vertical 2 2 2 2 2 10 1 0 1 transform set Horizontal 0 0 0 0 0 1 0 1 0 1 transform setIntra-prediction mode 60 61 62 63 64 65 66 Vertical 0 1 0 1 0 1 0transform set Horizontal 0 1 0 1 0 1 0 transform set

In Table 5, numbers of vertical transform sets and horizontal transformsets that are to be applied to the horizontal direction of a residualsignal depending on the intra-prediction modes of the target block areindicated.

As exemplified in Table 5, transform sets to be applied to thehorizontal direction and the vertical direction may be predefineddepending on the intra-prediction mode of the target block. The encodingapparatus 100 may perform a transform and an inverse transform on theresidual signal using a transform included in the transform setcorresponding to the intra-prediction mode of the target block. Further,the decoding apparatus 200 may perform an inverse transform on theresidual signal using a transform included in the transform setcorresponding to the intra-prediction mode of the target block.

In the transform and inverse transform, transform sets to be applied tothe residual signal may be determined, as exemplified in Tables 3, and4, and may not be signaled. Transform indication information may besignaled from the encoding apparatus 100 to the decoding apparatus 200.The transform indication information may be information indicating whichone of multiple transform candidates included in the transform set to beapplied to the residual signal is used.

For example, when the size of the target block is 64×64 or less,transform sets, each having three transforms, may be configureddepending on the intra-prediction modes, as shown in the examples ofTable 4. An optimal transform method may be selected from among a totalof nine multiple transform methods resulting from combinations of threetransforms in a horizontal direction and three transforms in a verticaldirection. Through such an optimal transform method, the residual signalmay be encoded and/or decoded, and thus coding efficiency may beimproved.

Here, information indicating which one of transforms belonging to eachtransform set has been used for at least one of a vertical transform anda horizontal transform may be entropy-encoded and/or -decoded. Here,truncated unary binarization may be used to encode and/or decode suchinformation.

As described above, methods using various transforms may be applied to aresidual signal generated via intra prediction or inter prediction.

The transform may include at least one of a first transform and asecondary transform. A transform coefficient may be generated byperforming the first transform on the residual signal, and a secondarytransform coefficient may be generated by performing the secondarytransform on the transform coefficient.

The first transform may be referred to as a “primary transform”.Further, the first transform may also be referred to as an “AdaptiveMultiple Transform (AMT) scheme”. AMT may mean that, as described above,different transforms are applied to respective 1D directions (i.e. avertical direction and a horizontal direction).

A secondary transform may be a transform for improving energyconcentration on a transform coefficient generated by the firsttransform. Similar to the first transform, the secondary transform maybe a separable transform or a non-separable transform. Such anon-separable transform may be a Non-Separable Secondary Transform(NSST).

The first transform may be performed using at least one of predefinedmultiple transform methods. For example, the predefined multipletransform methods may include a Discrete Cosine Transform (DCT), aDiscrete Sine Transform (DST), a Karhunen-Loeve Transform (KLT), etc.

Further, a first transform may be a transform having various typesdepending on a kernel function that defines a DCT or a DST.

For example, the first transform may include transforms, such as DCT-2,DCT-5, DCT-7, DST-1, and DST-8 depending on the transform kernelpresented in the following Table 6. In the following Table 6, varioustransform types and transform kernel functions for Multiple TransformSelection (MTS) are exemplified.

MTS may refer to the selection of combinations of one or more DCT and/orDST kernels so as to transform a residual signal in a horizontal and/orvertical direction.

TABLE 6 Transform type Transform kernel function T_(i)(j) DCT-2${T_{i}(j)} = {\omega_{0} \cdot \sqrt{\frac{2}{N}} \cdot {\cos\left( \frac{\pi \cdot i \cdot \left( {{2j} + 1} \right)}{2N} \right)}}$${{where}\mspace{14mu} \omega_{0}} = {\sqrt{\frac{2}{N}}\mspace{14mu} \left( {i = 0} \right)\mspace{14mu} {or}\mspace{14mu} 1\mspace{14mu} ({otherwise})}$DST-7${T_{i}(j)} = {\sqrt{\frac{4}{{2N} + 1}} \cdot {\sin\left( \frac{\pi \cdot \left( {{2j} + 1} \right) \cdot \left( {j + 1} \right)}{{2N} + 1} \right)}}$DCT-5${T_{i}(j)} = {\omega_{0} \cdot \omega_{1} \cdot \sqrt{\frac{2}{{2N} - 1}} \cdot {\cos\left( \frac{2{\pi \cdot i \cdot j}}{{2N} + 1} \right)}}$${{where}\mspace{14mu} \omega_{0/1}} = {\sqrt{\frac{2}{N}}\mspace{14mu} \left( {{i\mspace{14mu} {or}\mspace{14mu} j} = 0} \right)\mspace{14mu} {or}\mspace{14mu} 1\mspace{14mu} ({otherwise})}$DCT-8${T_{i}(j)} = {\sqrt{\frac{4}{{2N} + 1}} \cdot {\cos\left( \frac{\pi \cdot \left( {{2j} + 1} \right) \cdot \left( {{2j} + 1} \right)}{{4N} + 2} \right)}}$DST-1${T_{i}(j)} = {\sqrt{\frac{2}{N + 1}} \cdot {\sin\left( \frac{\pi \cdot \left( {i + 1} \right) \cdot \left( {j + 1} \right)}{N + 1} \right)}}$

In Table 6, i and j may be integer values that are equal to or greaterthan 0 and are less than or equal to N−1.

The secondary transform may be performed on the transform coefficientgenerated by performing the first transform.

As in the first transform, transform sets may also be defined in asecondary transform. The methods for deriving and/or determining theabove-described transform sets may be applied not only to the firsttransform but also to the secondary transform.

The first transform and the secondary transform may be determined for aspecific target.

For example, A first transform and a secondary transform may be appliedto signal components corresponding to one or more of a luminance (luma)component and a chrominance (chroma) component. Whether to apply thefirst transform and/or the secondary transform may be determineddepending on at least one of coding parameters for a target block and/ora neighboring block. For example, whether to apply the first transformand/or the secondary transform may be determined depending on the sizeand/or shape of the target block.

In the encoding apparatus 100 and the decoding apparatus 200, transforminformation indicating the transform method to be used for the targetmay be derived by utilizing specified information.

For example, the transform information may include a transform index tobe used for a primary transform and/or a secondary transform.Alternatively, the transform information may indicate that a primarytransform and/or a secondary transform are not used.

For example, when the target of a primary transform and a secondarytransform is a target block, the transform method(s) to be applied tothe primary transform and/or the secondary transform indicated by thetransform information may be determined depending on at least one ofcoding parameters for the target block and/or blocks neighboring thetarget block.

Alternatively, transform information for a specific target may besignaled from the encoding apparatus 100 to the decoding apparatus 200.

For example, for a single CU, whether to use a primary transform, anindex indicating the primary transform, whether to use a secondarytransform, and an index indicating the secondary transform may bederived as the transform information by the decoding apparatus 200.Alternatively, for a single CU, the transform information, whichindicates whether to use a primary transform, an index indicating theprimary transform, whether to use a secondary transform, and an indexindicating the secondary transform, may be signaled.

The quantized transform coefficient (i.e. the quantized levels) may begenerated by performing quantization on the result, generated byperforming the primary transform and/or the secondary transform, or onthe residual signal.

FIG. 13 illustrates diagonal scanning according to an example.

FIG. 14 illustrates horizontal scanning according to an example.

FIG. 15 illustrates vertical scanning according to an example.

Quantized transform coefficients may be scanned via at least one of(up-right) diagonal scanning, vertical scanning, and horizontal scanningdepending on at least one of an intra-prediction mode, a block size, anda block shape. The block may be a Transform Unit (TU).

Each scanning may be initiated at a specific start point, and may beterminated at a specific end point.

For example, quantized transform coefficients may be changed to 1Dvector forms by scanning the coefficients of a block using diagonalscanning of FIG. 13. Alternatively, horizontal scanning of FIG. 14 orvertical scanning of FIG. 15, instead of diagonal scanning, may be useddepending on the size and/or intra-prediction mode of a block.

Vertical scanning may be the operation of scanning 2D block-typecoefficients in a column direction. Horizontal scanning may be theoperation of scanning 2D block-type coefficients in a row direction.

In other words, which one of diagonal scanning, vertical scanning, andhorizontal scanning is to be used may be determined depending on thesize and/or inter-prediction mode of the block.

As illustrated in FIGS. 13, 14, and 15, the quantized transformcoefficients may be scanned along a diagonal direction, a horizontaldirection or a vertical direction.

The quantized transform coefficients may be represented by block shapes.Each block may include multiple sub-blocks. Each sub-block may bedefined depending on a minimum block size or a minimum block shape.

In scanning, a scanning sequence depending on the type or direction ofscanning may be primarily applied to sub-blocks. Further, a scanningsequence depending on the direction of scanning may be applied toquantized transform coefficients in each sub-block.

For example, as illustrated in FIGS. 13, 14, and 15, when the size of atarget block is 8×8, quantized transform coefficients may be generatedthrough a primary transform, a secondary transform, and quantization onthe residual signal of the target block. Therefore, one of three typesof scanning sequences may be applied to four 4×4 sub-blocks, andquantized transform coefficients may also be scanned for each 4×4sub-block depending on the scanning sequence.

The scanned quantized transform coefficients may be entropy-encoded, anda bitstream may include the entropy-encoded quantized transformcoefficients.

The decoding apparatus 200 may generate quantized transform coefficientsvia entropy decoding on the bitstream. The quantized transformcoefficients may be aligned in the form of a 2D block via inversescanning. Here, as the method of inverse scanning, at least one ofup-right diagonal scanning, vertical scanning, and horizontal scanningmay be performed.

In the decoding apparatus 200, dequantization may be performed on thequantized transform coefficients. A secondary inverse transform may beperformed on the result generated by performing dequantization dependingon whether to perform the secondary inverse transform. Further, a firstinverse transform may be performed on the result generated by performingthe secondary inverse transform depending on whether the first inversetransform is to be performed. A reconstructed residual signal may begenerated by performing the first inverse transform on the resultgenerated by performing the secondary inverse transform.

FIG. 16 is a configuration diagram of an encoding apparatus according toan embodiment.

An encoding apparatus 1600 may correspond to the above-describedencoding apparatus 100.

The encoding apparatus 1600 may include a processing unit 1610, memory1630, a user interface (UI) input device 1650, a UI output device 1660,and storage 1640, which communicate with each other through a bus 1690.The encoding apparatus 1600 may further include a communication unit1620 coupled to a network 1699.

The processing unit 1610 may be a Central Processing Unit (CPU) or asemiconductor device for executing processing instructions stored in thememory 1630 or the storage 1640. The processing unit 1610 may be atleast one hardware processor.

The processing unit 1610 may generate and process signals, data orinformation that are input to the encoding apparatus 1600, are outputfrom the encoding apparatus 1600, or are used in the encoding apparatus1600, and may perform examination, comparison, determination, etc.related to the signals, data or information. In other words, inembodiments, the generation and processing of data or information andexamination, comparison and determination related to data or informationmay be performed by the processing unit 1610.

The processing unit 1610 may include an inter-prediction unit 110, anintra-prediction unit 120, a switch 115, a subtractor 125, a transformunit 130, a quantization unit 140, an entropy encoding unit 150, adequantization unit 160, an inverse transform unit 170, an adder 175, afilter unit 180, and a reference picture buffer 190.

At least some of the inter-prediction unit 110, the intra-predictionunit 120, the switch 115, the subtractor 125, the transform unit 130,the quantization unit 140, the entropy encoding unit 150, thedequantization unit 160, the inverse transform unit 170, the adder 175,the filter unit 180, and the reference picture buffer 190 may be programmodules, and may communicate with an external device or system. Theprogram modules may be included in the encoding apparatus 1600 in theform of an operating system, an application program module, or otherprogram modules.

The program modules may be physically stored in various types ofwell-known storage devices. Further, at least some of the programmodules may also be stored in a remote storage device that is capable ofcommunicating with the encoding apparatus 1200.

The program modules may include, but are not limited to, a routine, asubroutine, a program, an object, a component, and a data structure forperforming functions or operations according to an embodiment or forimplementing abstract data types according to an embodiment.

The program modules may be implemented using instructions or codeexecuted by at least one processor of the encoding apparatus 1600.

The processing unit 1610 may execute instructions or code in theinter-prediction unit 110, the intra-prediction unit 120, the switch115, the subtractor 125, the transform unit 130, the quantization unit140, the entropy encoding unit 150, the dequantization unit 160, theinverse transform unit 170, the adder 175, the filter unit 180, and thereference picture buffer 190.

A storage unit may denote the memory 1630 and/or the storage 1640. Eachof the memory 1630 and the storage 1640 may be any of various types ofvolatile or nonvolatile storage media. For example, the memory 1630 mayinclude at least one of Read-Only Memory (ROM) 1631 and Random AccessMemory (RAM) 1632.

The storage unit may store data or information used for the operation ofthe encoding apparatus 1600. In an embodiment, the data or informationof the encoding apparatus 1600 may be stored in the storage unit.

For example, the storage unit may store pictures, blocks, lists, motioninformation, inter-prediction information, bitstreams, etc.

The encoding apparatus 1600 may be implemented in a computer systemincluding a computer-readable storage medium.

The storage medium may store at least one module required for theoperation of the encoding apparatus 1600. The memory 1630 may store atleast one module, and may be configured such that the at least onemodule is executed by the processing unit 1610.

Functions related to communication of the data or information of theencoding apparatus 1600 may be performed through the communication unit1220.

For example, the communication unit 1620 may transmit a bitstream to adecoding apparatus 1600, which will be described later.

FIG. 17 is a configuration diagram of a decoding apparatus according toan embodiment.

The decoding apparatus 1700 may correspond to the above-describeddecoding apparatus 200.

The decoding apparatus 1700 may include a processing unit 1710, memory1730, a user interface (UI) input device 1750, a UI output device 1760,and storage 1740, which communicate with each other through a bus 1790.The decoding apparatus 1700 may further include a communication unit1720 coupled to a network 1399.

The processing unit 1710 may be a Central Processing Unit (CPU) or asemiconductor device for executing processing instructions stored in thememory 1730 or the storage 1740. The processing unit 1710 may be atleast one hardware processor.

The processing unit 1710 may generate and process signals, data orinformation that are input to the decoding apparatus 1700, are outputfrom the decoding apparatus 1700, or are used in the decoding apparatus1700, and may perform examination, comparison, determination, etc.related to the signals, data or information. In other words, inembodiments, the generation and processing of data or information andexamination, comparison and determination related to data or informationmay be performed by the processing unit 1710.

The processing unit 1710 may include an entropy decoding unit 210, adequantization unit 220, an inverse transform unit 230, anintra-prediction unit 240, an inter-prediction unit 250, a switch 245,an adder 255, a filter unit 260, and a reference picture buffer 270.

At least some of the entropy decoding unit 210, the dequantization unit220, the inverse transform unit 230, the intra-prediction unit 240, theinter-prediction unit 250, the adder 255, the switch 245, the filterunit 260, and the reference picture buffer 270 of the decoding apparatus200 may be program modules, and may communicate with an external deviceor system. The program modules may be included in the decoding apparatus1700 in the form of an operating system, an application program module,or other program modules.

The program modules may be physically stored in various types ofwell-known storage devices. Further, at least some of the programmodules may also be stored in a remote storage device that is capable ofcommunicating with the decoding apparatus 1700.

The program modules may include, but are not limited to, a routine, asubroutine, a program, an object, a component, and a data structure forperforming functions or operations according to an embodiment or forimplementing abstract data types according to an embodiment.

The program modules may be implemented using instructions or codeexecuted by at least one processor of the decoding apparatus 1700.

The processing unit 1710 may execute instructions or code in the entropydecoding unit 210, the dequantization unit 220, the inverse transformunit 230, the intra-prediction unit 240, the inter-prediction unit 250,the switch 245, the adder 255, the filter unit 260, and the referencepicture buffer 270.

A storage unit may denote the memory 1730 and/or the storage 1740. Eachof the memory 1730 and the storage 1740 may be any of various types ofvolatile or nonvolatile storage media. For example, the memory 1730 mayinclude at least one of ROM 1731 and RAM 1732.

The storage unit may store data or information used for the operation ofthe decoding apparatus 1700. In an embodiment, the data or informationof the decoding apparatus 1700 may be stored in the storage unit.

For example, the storage unit may store pictures, blocks, lists, motioninformation, inter-prediction information, bitstreams, etc.

The decoding apparatus 1700 may be implemented in a computer systemincluding a computer-readable storage medium.

The storage medium may store at least one module required for theoperation of the decoding apparatus 1700. The memory 1730 may store atleast one module, and may be configured such that the at least onemodule is executed by the processing unit 1710.

Functions related to communication of the data or information of thedecoding apparatus 1700 may be performed through the communication unit1720.

For example, the communication unit 1720 may receive a bitstream fromthe encoding apparatus 1600.

FIG. 18 is a flowchart of a method for generating a reconstructed blockaccording to an embodiment.

A reconstructed block may be generated in an encoding apparatus 100 anda decoding apparatus 200.

Hereinafter, a processing unit may be the processing unit 1610 of theencoding apparatus 1600 or the processing unit 1710 of the decodingapparatus 1700. A dequantization unit may be the dequantization unit 160of the encoding apparatus 100 or the dequantization unit 220 of thedecoding apparatus 200. An inverse-transform unit may be theinverse-transform unit 170 of the encoding apparatus 100 or theinverse-transform unit 230 of the decoding apparatus 200. Anintra-prediction unit may be the intra-prediction unit 120 of theencoding apparatus 100 or the intra-prediction unit 240 of the decodingapparatus 200. An inter-prediction unit may be the inter-prediction unit110 of the encoding apparatus 100 or the inter-prediction unit 250 ofthe decoding apparatus 200. An adder may be the adder 175 of theencoding apparatus 100 or the adder 255 of the decoding apparatus 200.

At step 1810, the processing unit may generate a residual block.

Step 1810 may include step 1811 and step 1812.

At step 1811, the dequantization unit may generate a dequantizedcoefficient by performing dequantization for a quantized level.

At step 1812, the inverse-transform unit may generate a reconstructedresidual block by performing inverse transform for the dequantizedcoefficient.

At step 1820, the processing unit may generate a prediction block for atarget block by predicting the target block using a prediction network.

The processing unit may include the intra-prediction unit and theinter-prediction unit.

The prediction network may include an intra-prediction network and aninter-prediction network.

For example, when intra-prediction is performed for the target block,the inter-prediction unit predicts the target block using theintra-prediction network, thereby generating a prediction block for thetarget block.

For example, when inter-prediction is performed for the target block,the inter-prediction unit predicts the target block using theinter-prediction network, thereby generating a prediction block for thetarget block.

At step 1830, the processing unit may generate a reconstructed blockbased on the prediction block and the reconstructed residual block.

The adder may generate a reconstructed block by adding the predictionblock and the reconstructed residual block.

FIG. 19 is a flowchart of an image-encoding method according to anembodiment.

At step 1910, the processing unit 1610 may generate a prediction blockfor a target block by predicting the target block using a predictionnetwork.

For example, when intra-prediction is performed for the target block,the intra-prediction unit predicts the target block using theintra-prediction network, thereby generating a prediction block for thetarget block.

For example, when inter-prediction is performed for the target block,the inter-prediction unit predicts the target block using theinter-prediction network, thereby generating a prediction block for thetarget block.

At step 1920, the processing unit 1610 may generate a residual block forthe target block based on the prediction block.

The subtractor 125 may generate a residual block, which is thedifference between the target block and the prediction block.

At step 1930, the transform unit 130 may generate a transformcoefficient for the target block by transforming the residual block.

At step 1940, the quantization unit 1940 performs quantization for thetransform coefficient, thereby generating a quantized level for thetarget block.

At step 1950, the entropy coding unit 150 may generate a bitstream. Thebitstream may be stored in the storage 1640. The bitstream may betransmitted to the decoding apparatus 1700 through the communicationunit 1620.

The bitstream may include information about the target block. Theinformation about the target block may include a coding parameterpertaining to the target block and the quantized level for the targetblock.

The information about the target block may be entropy-coded by theentropy coding unit 150. The entropy coding unit 150 performs entropycoding for the information about the target block, thereby generatingentropy-coded information about the target block. For example, thebitstream may include the entropy-coded information about the targetblock.

At step 1960, the processing unit 1610 may generate a reconstructedblock for the target block. Step 1960 may include steps 1810, 1820 and1830, which are described above with reference to FIG. 18.

FIG. 20 is a flowchart of an image-decoding method according to anembodiment.

At step 2010, the communication unit 1710 may receive a bitstream.

The bitstream may include information about a target block. Theinformation about the target block may include a coding parameterpertaining to the target block and a quantized level for the targetblock.

Alternatively, the bitstream may include entropy-coded information aboutthe target block. The entropy decoding unit 210 may generate informationabout the target block by performing entropy decoding for theentropy-coded information about the target block.

At step 2020, the processing unit may generate a reconstructed block forthe target block using the information about the target block. Step 2020may include steps 1810, 1820 and 1830, which are described above withreference to FIG. 18.

FIG. 21 shows the generation of a prediction block using anintra-prediction network according to an example.

The prediction network, described with reference to FIG. 18, may be anintra-prediction network.

The intra-prediction network may predict the target block using aspatial reference block.

The spatial reference block may be the above-described spatial neighborblock.

The spatial reference block may be a reconstructed block.

The spatial reference block may comprise multiple spatial referenceblocks.

Descriptions of the spatial neighbor block and the reference block inthe above-described embodiment may also be applied in the presentembodiment.

FIG. 22 shows reference blocks for an intra-prediction network accordingto an example.

Multiple reference blocks for a target block may be selected based onthe positions thereof relative to the target block.

The multiple reference blocks for the target block may include areconstructed block adjacent to, above, and to the left of the targetblock, a reconstructed block adjacent to and above the target block, anda reconstructed block adjacent to and to the left of the target block.

The shape of the reference block and the shape of the target block maydiffer from each other. Also, the size of the reference block and thesize of the target block may differ from each other.

FIG. 23 shows reference blocks for an intra-prediction network accordingto an example.

Multiple reference blocks for a target block may include a reconstructedblock adjacent to, above, and to the left of the target block, areconstructed block adjacent to and above the target block, and areconstructed block adjacent to and to the left of the target block.

The shape of the reference block and the shape of the target block maybe the same as each other. Also, the size of the reference block and thesize of the target block may be the same as each other.

FIG. 24 shows the generation of a prediction block using aninter-prediction network according to an example.

The prediction network, described with reference to FIG. 18, may be aninter-prediction network.

The inter-prediction network may predict a target block using a temporalreference block.

The temporal reference block may be the above-described temporalneighbor block.

The temporal reference block may be a reconstructed block.

The temporal reference block may comprise multiple temporal referenceblocks.

Also, the inter-prediction network may predict the target block using aspatial reference block. That is, the spatial reference block may beadditionally input to the inter-prediction network.

The spatial reference block may be a reconstructed block. The spatialreference block may comprise multiple spatial reference blocks.

Descriptions of the spatial neighbor block, the spatial reference block,the temporal neighbor block, and the temporal reference block in theabove-described embodiment may also be applied in the presentembodiment.

FIG. 25 shows temporal reference blocks for an inter-prediction networkaccording to an example.

In order to generate a prediction block for a target block using aninter-prediction network, a reconstructed block included in a referencepicture, which is encoded and/or decoded before encoding and/or decodingof a target picture, may be used as a reference block. The referencepicture may be a picture included in a specified reference picture list.

For example, the temporal reference block may be a reconstructed block,which is a partial region in the reference picture in the L0 direction.

For example, the temporal reference block may be a reconstructed block,which is a partial region in the reference picture in the L1 direction.

The prediction network may comprise multiple prediction networks. Forexample, the above-described intra-prediction network may be multipleintra-prediction networks in each of the encoding apparatus 100 and thedecoding apparatus 200. Also, the above-described inter-predictionnetwork may be multiple inter-prediction networks in each of theencoding apparatus 100 and the decoding apparatus 200.

A coding parameter related to the target block may have one of multiplevalues. The multiple values may indicate different states of the codingparameter. The multiple prediction networks may be configured and usedrespectively for the different values of the coding parameter related tothe target block. The multiple prediction networks may include multipleintra-prediction networks and/or multiple inter-prediction networks.

For example, the multiple prediction networks may be used respectivelyfor multiple color channels, multiple block sizes, or multiplequantization parameters.

For example, the color channel of the target block may comprise multiplecolor channels. The multiple prediction networks may be used forrespective multiple color channels. The multiple intra-predictionnetworks may be used for respective multiple color channels. Themultiple inter-prediction networks may be used for respective multiplecolor channels.

For example, the block sizes of the prediction blocks for the targetblocks may differ from each other. For example, the multiple predictionnetworks may be used for respective multiple block sizes. The multipleintra-prediction networks may be used for respective multiple blocksizes. The multiple inter-prediction networks may be used for respectivemultiple block sizes.

For example, the quantization parameters for the target blocks maydiffer from each other. For example, the multiple prediction networksmay be used for respective multiple quantization parameters. Themultiple intra-prediction networks may be used for respective multiplequantization parameters. The multiple inter-prediction networks may beused for respective multiple quantization parameters.

FIG. 26 shows an intra-prediction network based on a fully connectedlayer according to an example.

The prediction network may be an artificial neural network including aninput layer, one or more hidden layers, and an output layer.

Each of the layers included in the above-described artificial neuralnetwork may include one or more nodes. The node may output a valuerepresented as a floating-point number or an integer. Also, one or morevalues may be input to the node.

As illustrated in FIG. 26, the prediction network may be based on fullyconnected layers. That is, each of the layers of the prediction networkmay be a fully connected layer.

Two nodes that are connected may mean that the output of the node of aprevious layer is provided as the input of the node of the layerfollowing the previous layer. That is, the two nodes that are connectedmay mean that the output end of the node of the previous layer isconnected with the input end of the node of the layer following theprevious layer.

The input layer may be a layer to which a reference block is input. Thereference block may comprise multiple reference blocks.

Each of the reference samples of the multiple reference blocks may beconnected with all of the nodes of a hidden layer H₁. The layer H₁ maybe the first hidden layer. Also, each of the nodes of the hidden layerH₁ may be connected with all of the reference samples of the multiplereference blocks.

Each of the nodes in a hidden layer H_(n-1) may be connected with all ofthe nodes of a hidden layer H_(n). Also, each of the nodes of the hiddenlayer H_(n) may be connected with all of the nodes of the hidden layerH_(n-1).

The output of the hidden layer H_(n) may be represented as shown in thefollowing Equation 2.

H _(n)(x)=ƒ(W _(n) x _(n) +b _(n))  [Equation 2]

n may be an integer that is equal to or greater than 1 and is equal toor less than L. L may be the number of hidden layers.

x_(n) may be the input vector of the layer H_(n). W_(n) may be theweight vector of the layer H_(n). b_(n) may be a bias.

ƒ(x) may be an activation function. As the activation function, asigmoid function, a hyperbolic tangent (tan h) function, a RectifiedLinear Unit (ReLU) function, a SoftMax function, an identity function,or the like may be used.

The output of the hidden layer H_(L), which is the last hidden layer,may be used to set the value of the sample of the prediction block.

Even though the prediction network is based on fully connected layers,at least some of the layers of the prediction network may be not fullyconnected layers but layers having a different connection state. Forexample, the layer having a different connection state may be a layer,the nodes of which are not fully connected, such as a convolutionallayer, a pooling layer, a deconvolutional layer, an unpooling layer, orthe like.

FIG. 27 shows an intra-prediction network based on a convolutional layeraccording to an example.

The prediction network may be an artificial neural network including aninput layer, one or more hidden layers, and an output layer.

In FIG. 27, the input layer may be a layer to which a reference blockand a target block are input. The reference block may comprise multiplereference blocks.

Specified regions in the multiple reference blocks and a specifiedregion in the target block may be connected with one of the nodes of thehidden layer H₁.

The specified region may be a region having a specified width and aspecified height. For example, the width of the specified region may bew, and the height thereof may be h. Each of h and w may be an integerthat is equal to or greater than 1. In a block, a region may indicatesamples in the region. That is, samples in the specified regions of themultiple reference blocks and samples in the specified region of thetarget block may be connected with one of the nodes of the hidden layerH₁.

Each of the samples of the target block may have a default value.Alternatively, each of the samples of the target block may have a randomvalue. The target block having default values or random values may beinput to the input layer.

The output of the hidden layer H_(n) may be represented as shown in thefollowing Equation 3.

H _(n)(x)=ƒ(W _(n) *x _(n) +b _(n))  [Equation 3]

n may be an integer that is equal to or greater than 1 and is equal toor less than L. L may be the number of hidden layers.

x_(n) may be the input of the layer H_(n). W_(n) may be the weight ofthe layer H_(n). b_(n) may be a bias. The operator * may indicateconvolution.

ƒ(x) may be an activation function. As the activation function, asigmoid function, a hyperbolic tangent (tan h) function, an ReLUfunction, a SoftMax function, an identity function, or the like may beused.

The output of the hidden layer H_(L), which is the last hidden layer,may be used to set the value of the sample of the prediction block.

Even though the prediction network is based on convolutional layers, atleast some of the layers of the prediction network may be notconvolutional layers but layers having a different connection state. Forexample, such a layer having a different connection state may be a fullyconnected layer, a pooling layer, a deconvolutional layer, an unpoolinglayer, or the like.

The input and output of the prediction network may be grayscale images.Alternatively, the input and output of the prediction network may beimages represented in a specified color space, such as RGB, YUV, orYCbCr. Also, the input and output of the prediction network may bemultiple image planes that are separated depending on the multiplechannels of the color space.

Before the sample of the reference block is input to the predictionnetwork, preprocessing may performed for the sample of the referenceblock. Also, when the sample of the prediction block is output from theprediction network, postprocessing may be performed for the sample ofthe prediction block. Here, postprocessing may be the reverse process ofpreprocessing. The sample of the prediction block may be used forprediction or the like after postprocessing is performed.

For example, preprocessing may be mean subtraction, normalization,Principal Component Analysis (PCA), or whitening.

For example, preprocessing may be mean subtraction, and postprocessingmay be the reverse process of mean subtraction.

For example, preprocessing may be normalization, and postprocessing maybe the reverse process of normalization.

For example, preprocessing may be PCA, and postprocessing may be thereverse process of PCA.

For example, preprocessing may be whitening, and postprocessing may bethe reverse process of whitening.

Learning in a Prediction Network

In order to use a prediction network for the prediction of a targetblock, learning in the prediction network should be performed.

The unit of learning in the prediction network may be an image. That is,learning in the prediction network may be performed for a single image.

The unit of learning in the prediction network may be a batch or a minibatch. The batch may be multiple images. That is, learning in theprediction network may be performed for the batch.

A batch normalization layer may be inserted in the input end of thehidden layer of the prediction network. For example, the batchnormalization layer may be inserted in the input end of each of one ormore hidden layers of the prediction network.

Learning in the prediction network may be performed by repeatedlyupdating the network parameter of the prediction network. Here, thenetwork parameter may be repeatedly updated through errorbackpropagation using a gradient descent or the like.

The network parameter may include the weight and bias of the node of thelayer of the prediction network. The weights and biases for all of thenodes of each of the layers of the prediction network may be set asnetwork parameters. That is, the network parameter may indicate alltrainable variables that affect the output of the prediction network.For example, the network parameters may include W_(n) and b_(n) inEquation 2 and Equation 3.

When the network parameter is updated, a learning rate may be used inorder to adjust the degree of learning. The learning rate may be a valuefor adjusting a change in the network parameter when learning isperformed once. A value related to learning may be multiplied by thelearning rate. For example, the gradient of a gradient descent algorithmmay be multiplied by the learning rate.

Various loss functions for learning in the prediction network may bedefined.

For example, the loss function for learning in the prediction networkmay be defined based on a prediction image and an original image. Theoriginal image may be an image that is input for learning in theprediction network. The prediction image may be an image output as theresult of learning in the prediction network.

For example, the loss function may be defined based on the square of thedifference between the prediction image and the original image, as shownin the following Equation 4.

$\begin{matrix}{{L(\Theta)} = \left. {\frac{1}{m}\sum\limits_{i = 1}^{m}}\;||{{F\left( {X_{i};\Theta} \right)} - Y_{i}} \right.||^{2}} & \left\lbrack {{Equation}\mspace{14mu} 4} \right\rbrack\end{matrix}$

For example, the loss function may be defined based on the absolutevalue of the difference between the prediction image and the originalimage.

$\begin{matrix}{{L(\Theta)} = \left. {\frac{1}{m}\sum\limits_{i = 1}^{m}}\; \middle| {{F\left( {X_{i};\Theta} \right)} - Y_{i}} \right|} & \left\lbrack {{Equation}\mspace{14mu} 5} \right\rbrack\end{matrix}$

θ may denote a network parameter. m may be the size of a batch or thesize of a mini batch. X_(i) may be the input to the prediction network.F(x) may be the output from the prediction network. Y_(i) may denote theoriginal image.

Through this learning process, learning in the prediction network may beperformed so as to decrease the difference between the prediction imageand the original image.

The loss function of the prediction network may be defined based on anadversarial loss function, as well as on the prediction image and theoriginal image.

For example, the loss function L_(total) may be defined as shown in thefollowing Equation 6.

L _(total.)=(1−α)L _(recon.) +αL _(adv.)  [Equation 6]

L_(recon.) may be a loss function according to the above-describedEquation 4 or Equation 5. That is, L_(recon.) may be the loss functiondefined based on the square of the difference between the predictionimage and the original image or the loss function defined based on theabsolute value of the difference between the prediction image and theoriginal image.

L_(adv.) may denote an adversarial loss function.

α may be a real number that is equal to or greater than 0 and is equalto or less than 1. α may adjust the percentages of L_(recon.) andL_(adv.).

As the result of learning in the prediction network, a default parameterθ_(default) may be defined. The default parameter may be a predefinedvalue. The default parameter may be used as the initial value of thenetwork parameter of the prediction network in the encoding apparatus100 and the decoding apparatus 200. The network may be initialized atvarious time points.

The network parameter of the prediction network may be repeatedlyinitialized in a single image sequence.

For example, the network parameter of the prediction network may beinitialized for a specified target, and the specified target may be 1) aslice, 2) a picture, 3) an instantaneous decoding refresh (IDR) picture,or 4) a picture having a temporal identifier (ID) that is different fromthe temporal ID of a previous picture, or the like.

For example, all of the network parameters of the prediction network maybe initialized when encoding or decoding of the IDR picture is started.

For example, all of the network parameters of the prediction network maybe initialized when encoding or decoding of each slice is started.

For example, the network parameter of the intra-prediction network maybe initialized when encoding or decoding of each picture is started.

For example, the network parameter of the inter-prediction network maybe initialized when encoding or decoding of a first picture having a newtemporal ID that is different from the temporal IDs of previous picturesin the group of pictures (GOP) is started.

Alternatively, the network parameter of the prediction network may beinitialized in a nonrecurrent manner at a specified time in a singleimage sequence.

The network parameter of the prediction network may be initialized usingdata pertaining to the initialization. For example, the data pertainingto the initialization may include the initial value of the networkparameter.

The data pertaining to the initialization of the network parameter ofthe prediction network may be a preset value or a value derived fromother data. Alternatively, the data pertaining to the initialization ofthe network parameter may be signaled using a bitstream from theencoding apparatus 100 to the decoding apparatus 200. The bitstream mayinclude the data pertaining to the initialization of the networkparameter.

The target to be signaled may be an available parameter set or a block.For example, one or more of a VPS, an SPS, a PPS, and a slice header mayinclude the data pertaining to the initialization of the networkparameter. Alternatively, one or more of a CTU, a CU, a PU, and a TU mayinclude the data pertaining to the initialization of the networkparameter. The data pertaining to the initialization of the networkparameter may be used for encoding and decoding of an entity includingthe data itself.

Online Update of a Prediction Network Parameter

FIG. 28 shows the online update of the parameter of a prediction networkaccording to an example.

The network parameter of the prediction network may be updated onlineusing the value of the sample of a residual block in the process ofencoding and/or decoding an image.

For the online update of the network parameter of the predictionnetwork, a bitstream may be received. By performing entropy decoding forthe bitstream, a quantized transform coefficient level (namely, aquantized level) may be generated. As described above with reference toFIG. 18, a residual block for the target block may be generated at step1810. Here, the residual block may be a reconstructed residual block.

When the residual block is generated, the online update of the networkparameter of the prediction network may be performed using the residualblock. At step 1810, the online update of the network parameter of theprediction network may be performed using the reconstructed residualblock.

When multiple prediction networks are present in the encoding apparatus100 or the decoding apparatus 200, the online update of the networkparameter may be performed in each of the multiple prediction networks.

Various loss functions may be defined for the online update of thenetwork parameter of the prediction network.

For example, the loss function may be determined based on the residualblock.

For example, the loss function may be defined based on the square of thevalue of the sample of the residual block as described in the followingEquation 7.

$\begin{matrix}{{L\left( \Theta_{online} \right)} = \left. {\frac{1}{s}\sum\limits_{i = 1}^{S}}\;||R_{i} \right.||^{2}} & \left\lbrack {{Equation}\mspace{14mu} 7} \right\rbrack\end{matrix}$

For example, the loss function may be defined based on the absolutevalue of the value of the sample of the residual block as described inthe following Equation 8.

$\begin{matrix}{{L\left( \Theta_{online} \right)} = \left. {\frac{1}{s}\sum\limits_{i = 1}^{S}}\; \middle| R_{i} \right|} & \left\lbrack {{Equation}\mspace{14mu} 8} \right\rbrack\end{matrix}$

Θ_(online) may be the network parameter of a prediction network. s maybe the number of residual blocks R_(i) input to the prediction network.R_(i) may be the sum of the values of the samples in the reconstructedresidual block. R_(i) may be generated through decoding of one or moreTUs.

For example, when the size of the residual block R_(i) is 16×16, theresidual block R_(i) may be a residual block generated through decodingof a single TU having a size of 16×16.

For example, when the size of the residual block R_(i) is 16×16, theresidual block R_(i) may be a residual block generated through decodingof four adjacent TUs, each having a size of 8×8.

Also, the loss function L_(total.), which is described above withreference to Equation 6, may be used as a loss function for the onlineupdate of the network parameter of the prediction network.

In an embodiment, the loss function for the online update of the networkparameter may be determined based on the reconstructed block.

In an embodiment, the loss function may be determined based on thereconstructed block. For example, the loss function may be defined basedon the value of the sample of the reconstructed block.

In Equation 7 and Equation 8, R_(i) may denote the difference betweenthe reconstructed block and the prediction block that is output from theprediction network. R_(i) may be the sum of differences. The differencemay be the difference between the value of the sample of thereconstructed block and the value of the sample of the prediction block.s may be the number of residual blocks R_(i).

For example, the loss function may be defined based on the square ofR_(i). Alternatively, the loss function may be defined based on theabsolute value of R_(i).

The online update of the network parameter of the prediction network maybe continuously performed during decoding of video. In other words, theonline update of the network parameter of the prediction network may berepeatedly performed in a single image sequence.

For example, the network parameter of the prediction network may beupdated for a specified target, and the specified target may be 1) aslice, 2) a picture, 3) an IDR picture or 4) a picture having a temporalID that is different from the temporal ID of a previous picture.

For example, the online update of all of the network parameters of theprediction network may be performed when encoding or decoding of the IDRpicture is completed.

For example, the online update of all of the network parameters of theprediction network may be performed when encoding or decoding of eachslice is completed.

For example, the online update of the network parameter of theintra-prediction network may be performed when encoding or decoding ofeach picture is completed.

For example, the online update of the network parameter of theinter-prediction network may be performed when encoding or decoding of afirst picture having a new temporal ID that is different from thetemporal IDs of previous pictures in the group of pictures is completed.

Alternatively, the online update of the network parameter of theprediction network may be performed in a nonrecurrent manner at aspecified time in a single image sequence.

When the network parameter of the prediction network is updated online,the degree of the update may be adjusted using an update rate.

The online update of the network parameter of the prediction network maybe performed using data pertaining to the online update. For example,the data pertaining to the online update may include informationindicating the time at which the online update is to be performed, theupdate rate of the online update, the number of residual blocks inputfor the online update, and the like.

The data pertaining to the online update of the network parameter may bea preset value or a value derived from other data. Alternatively, thedata pertaining to the online update of the network parameter may besignaled using a bitstream from the encoding apparatus 100 to thedecoding apparatus 200. The bitstream may include the data pertaining tothe online update of the network parameter.

The target to be signaled may be an available parameter set or a block.For example, one or more of a VPS, an SPS, a PPS and a slice header mayinclude the data pertaining to the online update of the networkparameter. Alternatively, one or more of a CTU, a CU, a PU and a TU mayinclude the data pertaining to the online update of the networkparameter. The data pertaining to the online update of the networkparameter may be used for encoding or decoding of an entity includingthe data itself.

The above-described embodiments may be implemented in the same manner inthe encoding apparatus 1600 and the decoding apparatus 1700.

The sequence in which the steps, operations, procedures and the like ofthe embodiments are applied in the encoding apparatus 1600 may bedifferent from that in the decoding apparatus 1700. Alternatively, thesequence in which the steps, operations, procedures, and the like of theembodiments are applied in the encoding apparatus 1600 may be the sameas that in the decoding apparatus 1700.

The embodiments may be implemented differently for a luma signal and achroma signal, respectively. Alternatively, the embodiments may beimplemented in the same manner for the luma signal and the chromasignal. For example, the prediction network in the embodiment may beapplied to some specified channels, among the multiple channels of thetarget block. The some channels may be luma channels or chroma channels.

The prediction network of the embodiment may be applied only when thetarget block is in a specified form. For example, the specified form maybe a square form or a non-square form.

Whether to apply the embodiments may be determined based on the size ofat least one of a CU, a PU, a TU, and a target block. Here, the size maybe defined as the minimum size and/or the maximum size required in orderto apply the embodiment to the target, or may be defined as a fixed sizerequired in order to apply the embodiment to the target.

Also, a first embodiment may be applied in the case of a first size, anda second embodiment may be applied in the case of a second size. Thatis, the embodiments may be complexly applied depending on the size ofthe target. Also, the embodiments may be applied only when the size ofthe target is equal to or greater than the minimum size and is equal toor less than the maximum size. That is, the embodiments may be appliedonly when the size of the target falls within a fixed range.

For example, the embodiments may be applied only when the size of atarget block is equal to or greater than a specified size. The specifiedsize may be 8×8, 16×16, 32×32, or 64×64.

For example, the embodiments may be applied only when the size of thetarget block is 4×4.

For example, the embodiments may be applied only when the size of thetarget block is equal to or less than a specified size. The specifiedsize may be 8×8, 16×16, 32×32, or 64×64.

For example, the embodiments may be applied only when the size of thetarget block is equal to or greater than 8×8 and is equal to or lessthan 16×16. For example, the embodiments may be applied only when thesize of the target block is equal to or greater than 16×16 and is equalto or less than 64×64.

Whether to apply the embodiments may be determined depending on atemporal layer. In order to identify the temporal layer to which theembodiments are applied, a special identifier may be signaled. For thetemporal layer specified using the identifier, the embodiments may beselectively applied. Here, the identifier may indicate the lowest layerand/or the highest layer that is required in order to apply theembodiment thereto, or may indicate a specified layer to which theembodiment is to be applied. Also, the temporal layer to which theembodiment is to be applied may be predefined.

For example, the embodiments may be applied only when the temporal layerof a target image is the lowest layer. For example, the embodiments maybe applied only when the identifier of the temporal layer of the targetimage is 0. For example, the embodiments may be applied only when theidentifier of the temporal layer of the target image is equal to orgreater than 1. For example, the embodiments may be applied only whenthe temporal layer of the target image is the highest layer.

The slice type to which the embodiments are applied may be defined. Theembodiments may be selectively applied depending on the type of theslice.

For example, when the type of the slice is an I-slice, the target blockmay be partitioned into subblocks, and the intra-prediction of theembodiment may be performed for the partitioned subblocks.

In the above-described embodiments, although the methods have beendescribed based on flowcharts as a series of steps or units, the presentdisclosure is not limited to the sequence of the steps and some stepsmay be performed in a sequence different from that of the describedsteps or simultaneously with other steps. Further, those skilled in theart will understand that the steps shown in the flowchart are notexclusive and may further include other steps, or that one or more stepsin the flowchart may be deleted without departing from the scope of thedisclosure.

The above-described embodiments according to the present disclosure maybe implemented as a program that can be executed by various computermeans and may be recorded on a computer-readable storage medium. Thecomputer-readable storage medium may include program instructions, datafiles, and data structures, either solely or in combination. Programinstructions recorded on the storage medium may have been speciallydesigned and configured for the present disclosure, or may be known toor available to those who have ordinary knowledge in the field ofcomputer software.

A computer-readable storage medium may include information used in theembodiments of the present disclosure. For example, thecomputer-readable storage medium may include a bitstream, and thebitstream may contain the information described above in the embodimentsof the present disclosure.

The computer-readable storage medium may include a non-transitorycomputer-readable medium.

Examples of the computer-readable storage medium include all types ofhardware devices specially configured to record and execute programinstructions, such as magnetic media, such as a hard disk, a floppydisk, and magnetic tape, optical media, such as compact disk (CD)-ROMand a digital versatile disk (DVD), magneto-optical media, such as afloptical disk, ROM, RAM, and flash memory. Examples of the programinstructions include machine code, such as code created by a compiler,and high-level language code executable by a computer using aninterpreter. The hardware devices may be configured to operate as one ormore software modules in order to perform the operation of the presentdisclosure, and vice versa.

As described above, although the present disclosure has been describedbased on specific details such as detailed components and a limitednumber of embodiments and drawings, those are merely provided for easyunderstanding of the entire disclosure, the present disclosure is notlimited to those embodiments, and those skilled in the art will practicevarious changes and modifications from the above description.

Accordingly, it should be noted that the spirit of the presentembodiments is not limited to the above-described embodiments, and theaccompanying claims and equivalents and modifications thereof fallwithin the scope of the present disclosure.

1. A decoding method, comprising: performing prediction for a targetblock using a prediction network, thereby generating a prediction blockfor the target block; and generating a reconstructed block for thetarget block based on the prediction block.
 2. The decoding method ofclaim 1, wherein the prediction network is an intra-prediction networkthat performs prediction for the target block using a spatial referenceblock.
 3. The decoding method of claim 1, wherein the prediction networkis an inter-prediction network that performs prediction for the targetblock using a temporal reference block.
 4. The decoding method of claim3, wherein the inter-prediction network performs prediction for thetarget block using a spatial reference block.
 5. The decoding method ofclaim 1, wherein: the prediction network comprises multiple predictionnetworks, and the multiple prediction networks are used respectively formultiple color channels, multiple block sizes, or multiple quantizationparameters.
 6. The decoding method of claim 1, wherein: the predictionnetwork generates the prediction block by performing prediction for thetarget block using a reference block; preprocessing is performed for asample of the reference block before the sample of the reference blockis input to the prediction network, and postprocessing, which is areverse process of the preprocessing, is performed for a sample of theprediction block when the sample of the prediction block is output fromthe prediction network.
 7. The decoding method of claim 6, wherein thepreprocessing is mean subtraction, normalization, principal componentanalysis (PCA), or whitening.
 8. The decoding method of claim 1, whereinlearning in the prediction network is performed for a single image. 9.The decoding method of claim 1, wherein learning in the predictionnetwork is performed for a batch.
 10. The decoding method of claim 1,wherein a batch normalization layer is inserted in an input end of ahidden layer of the prediction network.
 11. The decoding method of claim1, wherein a loss function for learning in the prediction network isdefined based on a prediction image and an original image.
 12. Thedecoding method of claim 11, wherein the loss function is defined basedon a square of a difference between the prediction image and theoriginal image.
 13. The decoding method of claim 11, wherein the lossfunction is defined based on an absolute value of a difference betweenthe prediction image and the original image.
 14. The decoding method ofclaim 1, wherein a loss function for online update of the predictionnetwork is determined based on a residual block.
 15. The decoding methodof claim 1, wherein a loss function for online update of the predictionnetwork is determined based on a reconstructed block.
 16. The decodingmethod of claim 1, wherein online update of a network parameter of theprediction network is continuously performed during decoding of video.17. The decoding method of claim 1, wherein a network parameter of theprediction network is initialized for a specified target.
 18. Thedecoding method of claim 17, wherein the specified target is a slice, apicture, or a picture having an identifier that is different from atemporal identifier of a previous picture.
 19. An encoding method,comprising: performing prediction for a target block using a predictionnetwork, thereby generating a prediction block for the target block; andgenerating a reconstructed block for the target block based on theprediction block.
 20. A computer-readable recording medium in which abitstream for decoding of an image is stored, the bitstream comprising:information about a target block, wherein: a prediction block for thetarget block is generated by performing prediction for the target blockusing a prediction network, and a reconstructed block for the targetblock is generated based on the information about the target block andthe prediction block.